/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_lamport.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 11:38:21,555 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 11:38:21,558 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 11:38:21,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 11:38:21,616 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 11:38:21,620 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 11:38:21,625 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 11:38:21,630 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 11:38:21,641 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 11:38:21,648 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 11:38:21,651 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 11:38:21,656 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 11:38:21,656 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 11:38:21,658 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 11:38:21,659 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 11:38:21,660 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 11:38:21,661 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 11:38:21,662 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 11:38:21,664 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 11:38:21,666 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 11:38:21,668 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 11:38:21,672 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 11:38:21,674 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 11:38:21,675 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 11:38:21,678 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 11:38:21,678 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 11:38:21,678 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 11:38:21,679 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 11:38:21,680 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 11:38:21,681 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 11:38:21,681 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 11:38:21,682 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 11:38:21,683 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 11:38:21,684 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 11:38:21,685 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 11:38:21,686 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 11:38:21,686 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 11:38:21,687 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 11:38:21,687 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 11:38:21,688 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 11:38:21,689 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 11:38:21,690 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 11:38:21,717 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 11:38:21,717 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 11:38:21,719 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 11:38:21,719 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 11:38:21,719 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 11:38:21,720 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 11:38:21,720 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 11:38:21,720 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 11:38:21,720 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 11:38:21,720 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 11:38:21,720 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 11:38:21,721 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 11:38:21,721 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 11:38:21,721 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 11:38:21,721 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 11:38:21,721 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 11:38:21,722 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 11:38:21,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 11:38:21,722 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 11:38:21,722 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 11:38:21,722 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 11:38:21,723 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 11:38:21,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 11:38:21,725 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 11:38:21,725 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 11:38:21,725 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 11:38:22,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 11:38:22,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 11:38:22,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 11:38:22,197 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 11:38:22,198 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 11:38:22,199 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_lamport.i [2020-12-23 11:38:22,282 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/bfb4d8e85/17122c5c6efc4b9c91e9675594cb5c41/FLAGba454ac53 [2020-12-23 11:38:23,026 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 11:38:23,026 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lamport.i [2020-12-23 11:38:23,065 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/bfb4d8e85/17122c5c6efc4b9c91e9675594cb5c41/FLAGba454ac53 [2020-12-23 11:38:23,310 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/bfb4d8e85/17122c5c6efc4b9c91e9675594cb5c41 [2020-12-23 11:38:23,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 11:38:23,318 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 11:38:23,322 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 11:38:23,323 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 11:38:23,327 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 11:38:23,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 11:38:23" (1/1) ... [2020-12-23 11:38:23,330 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d12266b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:38:23, skipping insertion in model container [2020-12-23 11:38:23,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 11:38:23" (1/1) ... [2020-12-23 11:38:23,339 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 11:38:23,425 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 11:38:23,807 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_lamport.i[23604,23617] 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[~b1~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[~b1~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: ArrayLHS[VariableLHS[~b1~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: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] 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[~b1~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~b2~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[~b2~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: ArrayLHS[VariableLHS[~b2~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: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] 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[~b2~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: lhs: VariableLHS[~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: ArrayLHS[VariableLHS[~__CS_cp_b1~0,],[IdentifierExpression[~i~0,]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_cp_b2~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: 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[2]]],[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[2]]],[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[2]]],[IntegerLiteral[2]]] 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[2]]],[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[2]]],[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[2]]],[IntegerLiteral[2]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~x~0,GLOBAL],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~x~0,GLOBAL],[IntegerLiteral[2]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~y~0,GLOBAL],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~y~0,GLOBAL],[IntegerLiteral[2]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~b1~0,GLOBAL],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~b1~0,GLOBAL],[IntegerLiteral[2]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~b2~0,GLOBAL],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~b2~0,GLOBAL],[IntegerLiteral[2]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~X~0,GLOBAL],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~X~0,GLOBAL],[IntegerLiteral[2]]] 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]]] [2020-12-23 11:38:24,042 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 11:38:24,059 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 11:38:24,102 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_lamport.i[23604,23617] 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[24],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[24],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[24],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[3],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[~#b1~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#b1~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[~#b1~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#b1~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[~#b1~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#b1~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: 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: 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[~#b1~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#b1~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[~#b2~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#b2~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[~#b2~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#b2~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[~#b2~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#b2~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: 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: 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[~#b2~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#b2~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]]]] left hand side expression in assignment: lhs: VariableLHS[~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: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_cp_b1~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_cp_b1~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~0,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_cp_b2~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_cp_b2~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: 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[3],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[24],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[3],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[4],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[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[8],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[24],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[32],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[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[64],StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~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[~#x~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],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: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#y~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#y~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#b1~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#b1~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#b1~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#b1~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#b2~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#b2~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#b2~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#b2~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[~#X~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#X~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[3],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[3],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[3],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]]]]] [2020-12-23 11:38:24,175 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 11:38:24,288 INFO L208 MainTranslator]: Completed translation [2020-12-23 11:38:24,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:38:24 WrapperNode [2020-12-23 11:38:24,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 11:38:24,291 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 11:38:24,291 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 11:38:24,291 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 11:38:24,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:38:24" (1/1) ... [2020-12-23 11:38:24,346 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:38:24" (1/1) ... [2020-12-23 11:38:24,458 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 11:38:24,459 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 11:38:24,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 11:38:24,460 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 11:38:24,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:38:24" (1/1) ... [2020-12-23 11:38:24,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:38:24" (1/1) ... [2020-12-23 11:38:24,511 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:38:24" (1/1) ... [2020-12-23 11:38:24,512 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:38:24" (1/1) ... [2020-12-23 11:38:24,587 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:38:24" (1/1) ... [2020-12-23 11:38:24,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:38:24" (1/1) ... [2020-12-23 11:38:24,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:38:24" (1/1) ... [2020-12-23 11:38:24,644 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 11:38:24,647 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 11:38:24,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 11:38:24,647 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 11:38:24,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:38:24" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 11:38:24,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 11:38:24,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 11:38:24,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 11:38:24,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 11:38:24,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 11:38:24,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 11:38:24,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-23 11:38:24,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 11:38:24,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 11:38:24,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 11:38:28,818 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 11:38:28,818 INFO L299 CfgBuilder]: Removed 160 assume(true) statements. [2020-12-23 11:38:28,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 11:38:28 BoogieIcfgContainer [2020-12-23 11:38:28,820 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 11:38:28,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 11:38:28,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 11:38:28,826 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 11:38:28,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 11:38:23" (1/3) ... [2020-12-23 11:38:28,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1d81cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 11:38:28, skipping insertion in model container [2020-12-23 11:38:28,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:38:24" (2/3) ... [2020-12-23 11:38:28,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1d81cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 11:38:28, skipping insertion in model container [2020-12-23 11:38:28,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 11:38:28" (3/3) ... [2020-12-23 11:38:28,829 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_lamport.i [2020-12-23 11:38:28,836 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 11:38:28,842 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 11:38:28,862 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 11:38:28,891 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 11:38:28,891 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 11:38:28,891 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 11:38:28,891 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 11:38:28,892 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 11:38:28,892 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 11:38:28,892 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 11:38:28,892 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 11:38:28,912 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states. [2020-12-23 11:38:28,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-12-23 11:38:28,923 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:38:28,924 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:38:28,925 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:38:28,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:38:28,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1960876399, now seen corresponding path program 1 times [2020-12-23 11:38:28,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:38:28,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548614137] [2020-12-23 11:38:28,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:38:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:29,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:38:29,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548614137] [2020-12-23 11:38:29,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:38:29,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:38:29,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796311207] [2020-12-23 11:38:29,337 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:38:29,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:38:29,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:38:29,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:38:29,355 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 3 states. [2020-12-23 11:38:29,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:38:29,471 INFO L93 Difference]: Finished difference Result 406 states and 636 transitions. [2020-12-23 11:38:29,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:38:29,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-12-23 11:38:29,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:38:29,487 INFO L225 Difference]: With dead ends: 406 [2020-12-23 11:38:29,487 INFO L226 Difference]: Without dead ends: 202 [2020-12-23 11:38:29,492 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:38:29,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2020-12-23 11:38:29,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 199. [2020-12-23 11:38:29,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2020-12-23 11:38:29,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 266 transitions. [2020-12-23 11:38:29,549 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 266 transitions. Word has length 56 [2020-12-23 11:38:29,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:38:29,550 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 266 transitions. [2020-12-23 11:38:29,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:38:29,550 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 266 transitions. [2020-12-23 11:38:29,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-23 11:38:29,553 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:38:29,578 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:38:29,579 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 11:38:29,579 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:38:29,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:38:29,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1377074985, now seen corresponding path program 1 times [2020-12-23 11:38:29,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:38:29,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397864089] [2020-12-23 11:38:29,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:38:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:29,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:38:29,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397864089] [2020-12-23 11:38:29,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:38:29,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:38:29,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848725444] [2020-12-23 11:38:29,699 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:38:29,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:38:29,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:38:29,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:38:29,701 INFO L87 Difference]: Start difference. First operand 199 states and 266 transitions. Second operand 3 states. [2020-12-23 11:38:29,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:38:29,742 INFO L93 Difference]: Finished difference Result 397 states and 532 transitions. [2020-12-23 11:38:29,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:38:29,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-12-23 11:38:29,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:38:29,745 INFO L225 Difference]: With dead ends: 397 [2020-12-23 11:38:29,745 INFO L226 Difference]: Without dead ends: 201 [2020-12-23 11:38:29,747 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:38:29,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-12-23 11:38:29,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2020-12-23 11:38:29,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-12-23 11:38:29,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 267 transitions. [2020-12-23 11:38:29,763 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 267 transitions. Word has length 59 [2020-12-23 11:38:29,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:38:29,763 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 267 transitions. [2020-12-23 11:38:29,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:38:29,763 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 267 transitions. [2020-12-23 11:38:29,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 11:38:29,766 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:38:29,767 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:38:29,767 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 11:38:29,767 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:38:29,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:38:29,768 INFO L82 PathProgramCache]: Analyzing trace with hash 903972697, now seen corresponding path program 1 times [2020-12-23 11:38:29,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:38:29,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915358191] [2020-12-23 11:38:29,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:38:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:29,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:38:29,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915358191] [2020-12-23 11:38:29,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857910869] [2020-12-23 11:38:29,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:38:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:30,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 11:38:30,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 11:38:30,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:38:30,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 11:38:30,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-12-23 11:38:30,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435629816] [2020-12-23 11:38:30,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 11:38:30,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:38:30,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 11:38:30,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:38:30,385 INFO L87 Difference]: Start difference. First operand 200 states and 267 transitions. Second operand 5 states. [2020-12-23 11:38:30,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:38:30,437 INFO L93 Difference]: Finished difference Result 400 states and 535 transitions. [2020-12-23 11:38:30,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 11:38:30,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2020-12-23 11:38:30,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:38:30,441 INFO L225 Difference]: With dead ends: 400 [2020-12-23 11:38:30,441 INFO L226 Difference]: Without dead ends: 203 [2020-12-23 11:38:30,443 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:38:30,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2020-12-23 11:38:30,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2020-12-23 11:38:30,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-12-23 11:38:30,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 269 transitions. [2020-12-23 11:38:30,457 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 269 transitions. Word has length 61 [2020-12-23 11:38:30,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:38:30,457 INFO L481 AbstractCegarLoop]: Abstraction has 202 states and 269 transitions. [2020-12-23 11:38:30,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 11:38:30,457 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 269 transitions. [2020-12-23 11:38:30,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-12-23 11:38:30,460 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:38:30,460 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:38:30,675 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-12-23 11:38:30,676 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:38:30,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:38:30,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1737493157, now seen corresponding path program 2 times [2020-12-23 11:38:30,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:38:30,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815150730] [2020-12-23 11:38:30,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:38:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:30,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-23 11:38:30,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815150730] [2020-12-23 11:38:30,912 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105785640] [2020-12-23 11:38:30,913 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:38:31,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 11:38:31,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 11:38:31,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 11:38:31,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 11:38:31,669 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-23 11:38:31,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 11:38:31,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2020-12-23 11:38:31,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796122135] [2020-12-23 11:38:31,670 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 11:38:31,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:38:31,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 11:38:31,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-23 11:38:31,671 INFO L87 Difference]: Start difference. First operand 202 states and 269 transitions. Second operand 4 states. [2020-12-23 11:38:31,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:38:31,732 INFO L93 Difference]: Finished difference Result 367 states and 486 transitions. [2020-12-23 11:38:31,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 11:38:31,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2020-12-23 11:38:31,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:38:31,736 INFO L225 Difference]: With dead ends: 367 [2020-12-23 11:38:31,736 INFO L226 Difference]: Without dead ends: 308 [2020-12-23 11:38:31,737 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-23 11:38:31,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2020-12-23 11:38:31,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2020-12-23 11:38:31,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2020-12-23 11:38:31,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 418 transitions. [2020-12-23 11:38:31,753 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 418 transitions. Word has length 63 [2020-12-23 11:38:31,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:38:31,754 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 418 transitions. [2020-12-23 11:38:31,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 11:38:31,754 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 418 transitions. [2020-12-23 11:38:31,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-12-23 11:38:31,757 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:38:31,757 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:38:31,970 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:38:31,971 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:38:31,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:38:31,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1308430535, now seen corresponding path program 1 times [2020-12-23 11:38:31,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:38:31,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056601241] [2020-12-23 11:38:31,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:38:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:32,153 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-23 11:38:32,155 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056601241] [2020-12-23 11:38:32,155 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509772770] [2020-12-23 11:38:32,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:38:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:32,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 11:38:32,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 11:38:32,565 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-23 11:38:32,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 11:38:32,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-12-23 11:38:32,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705602702] [2020-12-23 11:38:32,566 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:38:32,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:38:32,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:38:32,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:38:32,568 INFO L87 Difference]: Start difference. First operand 308 states and 418 transitions. Second operand 3 states. [2020-12-23 11:38:34,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:38:34,859 INFO L93 Difference]: Finished difference Result 881 states and 1196 transitions. [2020-12-23 11:38:34,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:38:34,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2020-12-23 11:38:34,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:38:34,864 INFO L225 Difference]: With dead ends: 881 [2020-12-23 11:38:34,864 INFO L226 Difference]: Without dead ends: 598 [2020-12-23 11:38:34,865 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:38:34,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-12-23 11:38:34,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 495. [2020-12-23 11:38:34,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2020-12-23 11:38:34,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 678 transitions. [2020-12-23 11:38:34,896 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 678 transitions. Word has length 92 [2020-12-23 11:38:34,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:38:34,898 INFO L481 AbstractCegarLoop]: Abstraction has 495 states and 678 transitions. [2020-12-23 11:38:34,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:38:34,898 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 678 transitions. [2020-12-23 11:38:34,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-12-23 11:38:34,903 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:38:34,903 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:38:35,117 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:38:35,118 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:38:35,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:38:35,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1254037637, now seen corresponding path program 1 times [2020-12-23 11:38:35,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:38:35,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164311630] [2020-12-23 11:38:35,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:38:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:35,211 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-23 11:38:35,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164311630] [2020-12-23 11:38:35,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400770628] [2020-12-23 11:38:35,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:38:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:35,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 11:38:35,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 11:38:35,637 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:38:35,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 11:38:35,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2020-12-23 11:38:35,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343123950] [2020-12-23 11:38:35,638 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 11:38:35,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:38:35,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 11:38:35,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-23 11:38:35,639 INFO L87 Difference]: Start difference. First operand 495 states and 678 transitions. Second operand 7 states. [2020-12-23 11:38:35,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:38:35,934 INFO L93 Difference]: Finished difference Result 1006 states and 1378 transitions. [2020-12-23 11:38:35,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-23 11:38:35,935 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2020-12-23 11:38:35,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:38:35,939 INFO L225 Difference]: With dead ends: 1006 [2020-12-23 11:38:35,939 INFO L226 Difference]: Without dead ends: 514 [2020-12-23 11:38:35,941 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2020-12-23 11:38:35,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2020-12-23 11:38:35,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 506. [2020-12-23 11:38:35,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2020-12-23 11:38:35,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 690 transitions. [2020-12-23 11:38:35,958 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 690 transitions. Word has length 92 [2020-12-23 11:38:35,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:38:35,958 INFO L481 AbstractCegarLoop]: Abstraction has 506 states and 690 transitions. [2020-12-23 11:38:35,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 11:38:35,959 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 690 transitions. [2020-12-23 11:38:35,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-12-23 11:38:35,963 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:38:35,963 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:38:36,177 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:38:36,178 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:38:36,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:38:36,179 INFO L82 PathProgramCache]: Analyzing trace with hash 478362091, now seen corresponding path program 2 times [2020-12-23 11:38:36,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:38:36,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59534371] [2020-12-23 11:38:36,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:38:36,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:36,503 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-12-23 11:38:36,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59534371] [2020-12-23 11:38:36,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199532600] [2020-12-23 11:38:36,504 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:38:36,822 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 11:38:36,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 11:38:36,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-23 11:38:36,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 11:38:36,924 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2020-12-23 11:38:36,924 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 11:38:36,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-12-23 11:38:36,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433168683] [2020-12-23 11:38:36,925 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:38:36,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:38:36,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:38:36,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-23 11:38:36,927 INFO L87 Difference]: Start difference. First operand 506 states and 690 transitions. Second operand 3 states. [2020-12-23 11:38:36,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:38:36,949 INFO L93 Difference]: Finished difference Result 799 states and 1080 transitions. [2020-12-23 11:38:36,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:38:36,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2020-12-23 11:38:36,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:38:36,953 INFO L225 Difference]: With dead ends: 799 [2020-12-23 11:38:36,953 INFO L226 Difference]: Without dead ends: 506 [2020-12-23 11:38:36,954 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-23 11:38:36,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2020-12-23 11:38:36,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2020-12-23 11:38:36,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2020-12-23 11:38:36,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 689 transitions. [2020-12-23 11:38:36,968 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 689 transitions. Word has length 103 [2020-12-23 11:38:36,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:38:36,968 INFO L481 AbstractCegarLoop]: Abstraction has 506 states and 689 transitions. [2020-12-23 11:38:36,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:38:36,968 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 689 transitions. [2020-12-23 11:38:36,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-12-23 11:38:36,970 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:38:36,970 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:38:37,183 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-12-23 11:38:37,184 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:38:37,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:38:37,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1405889393, now seen corresponding path program 1 times [2020-12-23 11:38:37,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:38:37,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684633641] [2020-12-23 11:38:37,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:38:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:37,359 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-12-23 11:38:37,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684633641] [2020-12-23 11:38:37,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396908044] [2020-12-23 11:38:37,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:38:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:37,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 868 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 11:38:37,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 11:38:37,921 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-12-23 11:38:37,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 11:38:37,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-12-23 11:38:37,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267656309] [2020-12-23 11:38:37,923 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 11:38:37,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:38:37,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 11:38:37,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 11:38:37,924 INFO L87 Difference]: Start difference. First operand 506 states and 689 transitions. Second operand 6 states. [2020-12-23 11:38:38,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:38:38,073 INFO L93 Difference]: Finished difference Result 1000 states and 1365 transitions. [2020-12-23 11:38:38,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:38:38,074 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2020-12-23 11:38:38,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:38:38,077 INFO L225 Difference]: With dead ends: 1000 [2020-12-23 11:38:38,078 INFO L226 Difference]: Without dead ends: 515 [2020-12-23 11:38:38,079 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 11:38:38,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2020-12-23 11:38:38,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2020-12-23 11:38:38,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2020-12-23 11:38:38,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 699 transitions. [2020-12-23 11:38:38,092 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 699 transitions. Word has length 103 [2020-12-23 11:38:38,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:38:38,093 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 699 transitions. [2020-12-23 11:38:38,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 11:38:38,093 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 699 transitions. [2020-12-23 11:38:38,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-12-23 11:38:38,095 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:38:38,095 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:38:38,309 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:38:38,309 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:38:38,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:38:38,311 INFO L82 PathProgramCache]: Analyzing trace with hash 887018239, now seen corresponding path program 2 times [2020-12-23 11:38:38,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:38:38,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630787303] [2020-12-23 11:38:38,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:38:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:38,512 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-12-23 11:38:38,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630787303] [2020-12-23 11:38:38,513 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:38:38,513 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:38:38,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712510580] [2020-12-23 11:38:38,514 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:38:38,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:38:38,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:38:38,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:38:38,515 INFO L87 Difference]: Start difference. First operand 515 states and 699 transitions. Second operand 3 states. [2020-12-23 11:38:38,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:38:38,677 INFO L93 Difference]: Finished difference Result 820 states and 1105 transitions. [2020-12-23 11:38:38,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:38:38,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2020-12-23 11:38:38,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:38:38,682 INFO L225 Difference]: With dead ends: 820 [2020-12-23 11:38:38,682 INFO L226 Difference]: Without dead ends: 530 [2020-12-23 11:38:38,683 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:38:38,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-12-23 11:38:38,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2020-12-23 11:38:38,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2020-12-23 11:38:38,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 717 transitions. [2020-12-23 11:38:38,700 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 717 transitions. Word has length 112 [2020-12-23 11:38:38,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:38:38,701 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 717 transitions. [2020-12-23 11:38:38,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:38:38,701 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 717 transitions. [2020-12-23 11:38:38,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-12-23 11:38:38,703 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:38:38,704 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:38:38,704 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 11:38:38,704 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:38:38,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:38:38,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1673844607, now seen corresponding path program 1 times [2020-12-23 11:38:38,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:38:38,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871591221] [2020-12-23 11:38:38,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:38:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:38,938 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-12-23 11:38:38,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871591221] [2020-12-23 11:38:38,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:38:38,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:38:38,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827951191] [2020-12-23 11:38:38,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 11:38:38,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:38:38,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 11:38:38,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 11:38:38,941 INFO L87 Difference]: Start difference. First operand 530 states and 717 transitions. Second operand 4 states. [2020-12-23 11:38:39,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:38:39,235 INFO L93 Difference]: Finished difference Result 779 states and 1042 transitions. [2020-12-23 11:38:39,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 11:38:39,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2020-12-23 11:38:39,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:38:39,239 INFO L225 Difference]: With dead ends: 779 [2020-12-23 11:38:39,239 INFO L226 Difference]: Without dead ends: 496 [2020-12-23 11:38:39,240 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 11:38:39,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2020-12-23 11:38:39,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2020-12-23 11:38:39,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2020-12-23 11:38:39,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 661 transitions. [2020-12-23 11:38:39,256 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 661 transitions. Word has length 112 [2020-12-23 11:38:39,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:38:39,256 INFO L481 AbstractCegarLoop]: Abstraction has 496 states and 661 transitions. [2020-12-23 11:38:39,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 11:38:39,257 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 661 transitions. [2020-12-23 11:38:39,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-12-23 11:38:39,259 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:38:39,259 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:38:39,259 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 11:38:39,259 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:38:39,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:38:39,260 INFO L82 PathProgramCache]: Analyzing trace with hash -719904449, now seen corresponding path program 1 times [2020-12-23 11:38:39,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:38:39,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735995447] [2020-12-23 11:38:39,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:38:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:44,399 WARN L197 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2020-12-23 11:38:44,742 WARN L197 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2020-12-23 11:38:45,113 WARN L197 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-12-23 11:38:45,398 WARN L197 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2020-12-23 11:38:45,597 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2020-12-23 11:38:45,887 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-12-23 11:38:45,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735995447] [2020-12-23 11:38:45,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:38:45,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-23 11:38:45,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050729310] [2020-12-23 11:38:45,890 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 11:38:45,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:38:45,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 11:38:45,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2020-12-23 11:38:45,891 INFO L87 Difference]: Start difference. First operand 496 states and 661 transitions. Second operand 15 states. [2020-12-23 11:38:48,560 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2020-12-23 11:38:48,846 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2020-12-23 11:38:49,077 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2020-12-23 11:38:49,398 WARN L197 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2020-12-23 11:38:53,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:38:53,550 INFO L93 Difference]: Finished difference Result 1100 states and 1461 transitions. [2020-12-23 11:38:53,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-23 11:38:53,551 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 112 [2020-12-23 11:38:53,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:38:53,556 INFO L225 Difference]: With dead ends: 1100 [2020-12-23 11:38:53,557 INFO L226 Difference]: Without dead ends: 880 [2020-12-23 11:38:53,558 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2020-12-23 11:38:53,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2020-12-23 11:38:53,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 547. [2020-12-23 11:38:53,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2020-12-23 11:38:53,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 724 transitions. [2020-12-23 11:38:53,583 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 724 transitions. Word has length 112 [2020-12-23 11:38:53,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:38:53,583 INFO L481 AbstractCegarLoop]: Abstraction has 547 states and 724 transitions. [2020-12-23 11:38:53,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 11:38:53,584 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 724 transitions. [2020-12-23 11:38:53,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-12-23 11:38:53,586 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:38:53,586 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:38:53,586 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 11:38:53,586 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:38:53,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:38:53,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1687255103, now seen corresponding path program 1 times [2020-12-23 11:38:53,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:38:53,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165842854] [2020-12-23 11:38:53,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:38:55,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:56,285 WARN L197 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2020-12-23 11:38:56,550 WARN L197 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2020-12-23 11:38:56,786 WARN L197 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 71 [2020-12-23 11:38:56,964 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 50 [2020-12-23 11:38:57,253 WARN L197 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 54 [2020-12-23 11:38:57,462 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 56 [2020-12-23 11:38:57,720 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-12-23 11:38:57,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165842854] [2020-12-23 11:38:57,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:38:57,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 11:38:57,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732315644] [2020-12-23 11:38:57,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 11:38:57,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:38:57,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 11:38:57,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-12-23 11:38:57,722 INFO L87 Difference]: Start difference. First operand 547 states and 724 transitions. Second operand 11 states. [2020-12-23 11:38:58,004 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2020-12-23 11:39:00,767 WARN L197 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 92 [2020-12-23 11:39:01,104 WARN L197 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 97 [2020-12-23 11:39:01,463 WARN L197 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 99 [2020-12-23 11:39:01,910 WARN L197 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 102 [2020-12-23 11:39:02,104 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-12-23 11:39:02,410 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-12-23 11:39:03,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:39:03,836 INFO L93 Difference]: Finished difference Result 976 states and 1280 transitions. [2020-12-23 11:39:03,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-23 11:39:03,837 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 112 [2020-12-23 11:39:03,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:39:03,843 INFO L225 Difference]: With dead ends: 976 [2020-12-23 11:39:03,843 INFO L226 Difference]: Without dead ends: 756 [2020-12-23 11:39:03,844 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2020-12-23 11:39:03,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2020-12-23 11:39:03,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 530. [2020-12-23 11:39:03,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2020-12-23 11:39:03,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 701 transitions. [2020-12-23 11:39:03,877 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 701 transitions. Word has length 112 [2020-12-23 11:39:03,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:39:03,877 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 701 transitions. [2020-12-23 11:39:03,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 11:39:03,878 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 701 transitions. [2020-12-23 11:39:03,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-12-23 11:39:03,882 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:39:03,882 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:39:03,883 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 11:39:03,883 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:39:03,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:39:03,886 INFO L82 PathProgramCache]: Analyzing trace with hash 377917729, now seen corresponding path program 1 times [2020-12-23 11:39:03,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:39:03,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393994847] [2020-12-23 11:39:03,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:39:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:39:04,035 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-12-23 11:39:04,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393994847] [2020-12-23 11:39:04,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:39:04,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:39:04,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932700688] [2020-12-23 11:39:04,037 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:39:04,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:39:04,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:39:04,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:39:04,038 INFO L87 Difference]: Start difference. First operand 530 states and 701 transitions. Second operand 3 states. [2020-12-23 11:39:04,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:39:04,143 INFO L93 Difference]: Finished difference Result 929 states and 1251 transitions. [2020-12-23 11:39:04,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:39:04,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2020-12-23 11:39:04,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:39:04,146 INFO L225 Difference]: With dead ends: 929 [2020-12-23 11:39:04,147 INFO L226 Difference]: Without dead ends: 544 [2020-12-23 11:39:04,148 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:39:04,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-12-23 11:39:04,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2020-12-23 11:39:04,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2020-12-23 11:39:04,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 714 transitions. [2020-12-23 11:39:04,175 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 714 transitions. Word has length 115 [2020-12-23 11:39:04,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:39:04,175 INFO L481 AbstractCegarLoop]: Abstraction has 544 states and 714 transitions. [2020-12-23 11:39:04,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:39:04,175 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 714 transitions. [2020-12-23 11:39:04,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-12-23 11:39:04,178 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:39:04,178 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:39:04,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 11:39:04,178 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:39:04,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:39:04,179 INFO L82 PathProgramCache]: Analyzing trace with hash -39478877, now seen corresponding path program 1 times [2020-12-23 11:39:04,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:39:04,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771871498] [2020-12-23 11:39:04,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:39:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:39:08,530 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-12-23 11:39:08,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771871498] [2020-12-23 11:39:08,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:39:08,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:39:08,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889278745] [2020-12-23 11:39:08,532 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 11:39:08,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:39:08,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 11:39:08,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:39:08,533 INFO L87 Difference]: Start difference. First operand 544 states and 714 transitions. Second operand 5 states. [2020-12-23 11:39:09,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:39:09,293 INFO L93 Difference]: Finished difference Result 1256 states and 1639 transitions. [2020-12-23 11:39:09,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 11:39:09,294 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2020-12-23 11:39:09,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:39:09,298 INFO L225 Difference]: With dead ends: 1256 [2020-12-23 11:39:09,299 INFO L226 Difference]: Without dead ends: 764 [2020-12-23 11:39:09,300 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-12-23 11:39:09,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2020-12-23 11:39:09,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 576. [2020-12-23 11:39:09,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2020-12-23 11:39:09,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 730 transitions. [2020-12-23 11:39:09,333 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 730 transitions. Word has length 115 [2020-12-23 11:39:09,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:39:09,333 INFO L481 AbstractCegarLoop]: Abstraction has 576 states and 730 transitions. [2020-12-23 11:39:09,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 11:39:09,333 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 730 transitions. [2020-12-23 11:39:09,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-12-23 11:39:09,336 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:39:09,336 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:39:09,336 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 11:39:09,336 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:39:09,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:39:09,337 INFO L82 PathProgramCache]: Analyzing trace with hash -210094109, now seen corresponding path program 1 times [2020-12-23 11:39:09,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:39:09,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183811274] [2020-12-23 11:39:09,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:39:15,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:39:15,512 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2020-12-23 11:39:15,682 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2020-12-23 11:39:15,904 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-12-23 11:39:15,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183811274] [2020-12-23 11:39:15,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:39:15,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 11:39:15,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57761128] [2020-12-23 11:39:15,905 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 11:39:15,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:39:15,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 11:39:15,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-12-23 11:39:15,907 INFO L87 Difference]: Start difference. First operand 576 states and 730 transitions. Second operand 11 states. [2020-12-23 11:39:18,468 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2020-12-23 11:39:19,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:39:19,762 INFO L93 Difference]: Finished difference Result 926 states and 1152 transitions. [2020-12-23 11:39:19,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 11:39:19,763 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 115 [2020-12-23 11:39:19,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:39:19,770 INFO L225 Difference]: With dead ends: 926 [2020-12-23 11:39:19,771 INFO L226 Difference]: Without dead ends: 758 [2020-12-23 11:39:19,772 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2020-12-23 11:39:19,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2020-12-23 11:39:19,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 576. [2020-12-23 11:39:19,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2020-12-23 11:39:19,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 727 transitions. [2020-12-23 11:39:19,804 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 727 transitions. Word has length 115 [2020-12-23 11:39:19,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:39:19,804 INFO L481 AbstractCegarLoop]: Abstraction has 576 states and 727 transitions. [2020-12-23 11:39:19,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 11:39:19,805 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 727 transitions. [2020-12-23 11:39:19,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-12-23 11:39:19,807 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:39:19,807 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:39:19,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 11:39:19,807 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:39:19,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:39:19,808 INFO L82 PathProgramCache]: Analyzing trace with hash 483421956, now seen corresponding path program 1 times [2020-12-23 11:39:19,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:39:19,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422791075] [2020-12-23 11:39:19,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:39:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:39:23,294 WARN L197 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 68 [2020-12-23 11:39:23,745 WARN L197 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 65 [2020-12-23 11:39:24,001 WARN L197 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 60 [2020-12-23 11:39:24,126 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-12-23 11:39:24,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422791075] [2020-12-23 11:39:24,127 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:39:24,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 11:39:24,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150761176] [2020-12-23 11:39:24,128 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 11:39:24,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:39:24,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 11:39:24,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-23 11:39:24,128 INFO L87 Difference]: Start difference. First operand 576 states and 727 transitions. Second operand 6 states. [2020-12-23 11:39:27,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:39:27,206 INFO L93 Difference]: Finished difference Result 673 states and 837 transitions. [2020-12-23 11:39:27,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 11:39:27,206 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2020-12-23 11:39:27,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:39:27,209 INFO L225 Difference]: With dead ends: 673 [2020-12-23 11:39:27,210 INFO L226 Difference]: Without dead ends: 556 [2020-12-23 11:39:27,210 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-12-23 11:39:27,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-12-23 11:39:27,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2020-12-23 11:39:27,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2020-12-23 11:39:27,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 703 transitions. [2020-12-23 11:39:27,273 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 703 transitions. Word has length 120 [2020-12-23 11:39:27,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:39:27,274 INFO L481 AbstractCegarLoop]: Abstraction has 556 states and 703 transitions. [2020-12-23 11:39:27,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 11:39:27,274 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 703 transitions. [2020-12-23 11:39:27,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-12-23 11:39:27,276 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:39:27,276 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:39:27,276 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 11:39:27,277 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:39:27,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:39:27,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1156181625, now seen corresponding path program 1 times [2020-12-23 11:39:27,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:39:27,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981846710] [2020-12-23 11:39:27,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:39:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:39:30,466 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-12-23 11:39:30,731 WARN L197 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 62 [2020-12-23 11:39:31,600 WARN L197 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 57 [2020-12-23 11:39:31,768 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-12-23 11:39:31,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981846710] [2020-12-23 11:39:31,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:39:31,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:39:31,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862636397] [2020-12-23 11:39:31,770 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 11:39:31,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:39:31,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 11:39:31,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:39:31,772 INFO L87 Difference]: Start difference. First operand 556 states and 703 transitions. Second operand 5 states. [2020-12-23 11:39:34,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:39:34,612 INFO L93 Difference]: Finished difference Result 794 states and 996 transitions. [2020-12-23 11:39:34,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 11:39:34,613 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2020-12-23 11:39:34,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:39:34,616 INFO L225 Difference]: With dead ends: 794 [2020-12-23 11:39:34,616 INFO L226 Difference]: Without dead ends: 534 [2020-12-23 11:39:34,616 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 16 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-23 11:39:34,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-12-23 11:39:34,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2020-12-23 11:39:34,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2020-12-23 11:39:34,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 676 transitions. [2020-12-23 11:39:34,645 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 676 transitions. Word has length 120 [2020-12-23 11:39:34,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:39:34,645 INFO L481 AbstractCegarLoop]: Abstraction has 534 states and 676 transitions. [2020-12-23 11:39:34,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 11:39:34,645 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 676 transitions. [2020-12-23 11:39:34,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-12-23 11:39:34,647 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:39:34,648 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:39:34,648 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 11:39:34,648 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:39:34,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:39:34,648 INFO L82 PathProgramCache]: Analyzing trace with hash 882640438, now seen corresponding path program 1 times [2020-12-23 11:39:34,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:39:34,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358957048] [2020-12-23 11:39:34,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:39:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:39:39,967 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-12-23 11:39:39,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358957048] [2020-12-23 11:39:39,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:39:39,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 11:39:39,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038526396] [2020-12-23 11:39:39,968 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 11:39:39,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:39:39,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 11:39:39,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-12-23 11:39:39,970 INFO L87 Difference]: Start difference. First operand 534 states and 676 transitions. Second operand 10 states. [2020-12-23 11:39:43,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:39:43,241 INFO L93 Difference]: Finished difference Result 657 states and 805 transitions. [2020-12-23 11:39:43,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 11:39:43,242 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 123 [2020-12-23 11:39:43,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:39:43,245 INFO L225 Difference]: With dead ends: 657 [2020-12-23 11:39:43,245 INFO L226 Difference]: Without dead ends: 609 [2020-12-23 11:39:43,246 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-12-23 11:39:43,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-12-23 11:39:43,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 539. [2020-12-23 11:39:43,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2020-12-23 11:39:43,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 682 transitions. [2020-12-23 11:39:43,277 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 682 transitions. Word has length 123 [2020-12-23 11:39:43,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:39:43,277 INFO L481 AbstractCegarLoop]: Abstraction has 539 states and 682 transitions. [2020-12-23 11:39:43,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 11:39:43,277 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 682 transitions. [2020-12-23 11:39:43,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-12-23 11:39:43,280 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:39:43,280 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:39:43,280 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 11:39:43,280 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:39:43,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:39:43,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1882264179, now seen corresponding path program 1 times [2020-12-23 11:39:43,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:39:43,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152771416] [2020-12-23 11:39:43,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:39:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:39:43,712 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-12-23 11:39:43,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152771416] [2020-12-23 11:39:43,713 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:39:43,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 11:39:43,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845837940] [2020-12-23 11:39:43,714 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 11:39:43,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:39:43,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 11:39:43,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-12-23 11:39:43,716 INFO L87 Difference]: Start difference. First operand 539 states and 682 transitions. Second operand 10 states. [2020-12-23 11:39:51,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:39:51,197 INFO L93 Difference]: Finished difference Result 1028 states and 1285 transitions. [2020-12-23 11:39:51,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 11:39:51,197 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 127 [2020-12-23 11:39:51,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:39:51,206 INFO L225 Difference]: With dead ends: 1028 [2020-12-23 11:39:51,206 INFO L226 Difference]: Without dead ends: 767 [2020-12-23 11:39:51,207 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-12-23 11:39:51,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2020-12-23 11:39:51,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 567. [2020-12-23 11:39:51,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2020-12-23 11:39:51,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 714 transitions. [2020-12-23 11:39:51,242 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 714 transitions. Word has length 127 [2020-12-23 11:39:51,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:39:51,243 INFO L481 AbstractCegarLoop]: Abstraction has 567 states and 714 transitions. [2020-12-23 11:39:51,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 11:39:51,243 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 714 transitions. [2020-12-23 11:39:51,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-12-23 11:39:51,245 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:39:51,245 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:39:51,245 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 11:39:51,245 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:39:51,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:39:51,246 INFO L82 PathProgramCache]: Analyzing trace with hash 51159306, now seen corresponding path program 1 times [2020-12-23 11:39:51,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:39:51,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216165419] [2020-12-23 11:39:51,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:39:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:39:56,470 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2020-12-23 11:39:56,724 WARN L197 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2020-12-23 11:39:56,938 WARN L197 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2020-12-23 11:39:57,152 WARN L197 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2020-12-23 11:39:57,413 WARN L197 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2020-12-23 11:39:57,726 WARN L197 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2020-12-23 11:39:57,968 WARN L197 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2020-12-23 11:39:58,261 WARN L197 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2020-12-23 11:39:58,571 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-12-23 11:39:58,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216165419] [2020-12-23 11:39:58,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:39:58,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-23 11:39:58,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524223864] [2020-12-23 11:39:58,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 11:39:58,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:39:58,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 11:39:58,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-12-23 11:39:58,573 INFO L87 Difference]: Start difference. First operand 567 states and 714 transitions. Second operand 12 states. [2020-12-23 11:40:01,056 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2020-12-23 11:40:01,343 WARN L197 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2020-12-23 11:40:02,123 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2020-12-23 11:40:02,957 WARN L197 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2020-12-23 11:40:04,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:40:04,698 INFO L93 Difference]: Finished difference Result 906 states and 1125 transitions. [2020-12-23 11:40:04,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-23 11:40:04,699 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 130 [2020-12-23 11:40:04,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:40:04,706 INFO L225 Difference]: With dead ends: 906 [2020-12-23 11:40:04,706 INFO L226 Difference]: Without dead ends: 858 [2020-12-23 11:40:04,707 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2020-12-23 11:40:04,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2020-12-23 11:40:04,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 633. [2020-12-23 11:40:04,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2020-12-23 11:40:04,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 807 transitions. [2020-12-23 11:40:04,754 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 807 transitions. Word has length 130 [2020-12-23 11:40:04,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:40:04,755 INFO L481 AbstractCegarLoop]: Abstraction has 633 states and 807 transitions. [2020-12-23 11:40:04,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 11:40:04,755 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 807 transitions. [2020-12-23 11:40:04,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-12-23 11:40:04,757 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:40:04,757 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:40:04,757 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 11:40:04,757 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:40:04,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:40:04,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1809309913, now seen corresponding path program 1 times [2020-12-23 11:40:04,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:40:04,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786883245] [2020-12-23 11:40:04,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:40:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:40:11,077 WARN L197 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 74 [2020-12-23 11:40:11,860 WARN L197 SmtUtils]: Spent 755.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 109 [2020-12-23 11:40:12,781 WARN L197 SmtUtils]: Spent 889.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 120 [2020-12-23 11:40:13,455 WARN L197 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 88 [2020-12-23 11:40:14,088 WARN L197 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 83 [2020-12-23 11:40:14,739 WARN L197 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 82 [2020-12-23 11:40:15,563 WARN L197 SmtUtils]: Spent 747.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 106 [2020-12-23 11:40:16,129 WARN L197 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 64 [2020-12-23 11:40:16,969 WARN L197 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 95 [2020-12-23 11:40:17,418 WARN L197 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 58 [2020-12-23 11:40:17,703 WARN L197 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 37 [2020-12-23 11:40:18,024 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 23 [2020-12-23 11:40:18,371 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-12-23 11:40:18,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786883245] [2020-12-23 11:40:18,371 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:40:18,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-23 11:40:18,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75501758] [2020-12-23 11:40:18,372 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-23 11:40:18,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:40:18,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-23 11:40:18,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-12-23 11:40:18,373 INFO L87 Difference]: Start difference. First operand 633 states and 807 transitions. Second operand 14 states. [2020-12-23 11:40:19,345 WARN L197 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 117 [2020-12-23 11:40:22,458 WARN L197 SmtUtils]: Spent 839.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 117 [2020-12-23 11:40:23,439 WARN L197 SmtUtils]: Spent 911.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 122 [2020-12-23 11:40:24,476 WARN L197 SmtUtils]: Spent 853.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 120 [2020-12-23 11:40:25,612 WARN L197 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 165 DAG size of output: 134 [2020-12-23 11:40:25,964 WARN L197 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2020-12-23 11:40:26,607 WARN L197 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 94 [2020-12-23 11:40:27,266 WARN L197 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 94 [2020-12-23 11:40:27,942 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2020-12-23 11:40:28,257 WARN L197 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 85 [2020-12-23 11:40:28,932 WARN L197 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2020-12-23 11:40:31,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:40:31,289 INFO L93 Difference]: Finished difference Result 842 states and 1027 transitions. [2020-12-23 11:40:31,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-23 11:40:31,290 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 130 [2020-12-23 11:40:31,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:40:31,294 INFO L225 Difference]: With dead ends: 842 [2020-12-23 11:40:31,294 INFO L226 Difference]: Without dead ends: 794 [2020-12-23 11:40:31,295 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2020-12-23 11:40:31,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2020-12-23 11:40:31,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 633. [2020-12-23 11:40:31,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2020-12-23 11:40:31,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 807 transitions. [2020-12-23 11:40:31,347 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 807 transitions. Word has length 130 [2020-12-23 11:40:31,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:40:31,348 INFO L481 AbstractCegarLoop]: Abstraction has 633 states and 807 transitions. [2020-12-23 11:40:31,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-23 11:40:31,348 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 807 transitions. [2020-12-23 11:40:31,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-12-23 11:40:31,350 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:40:31,350 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:40:31,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 11:40:31,350 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:40:31,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:40:31,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1924957605, now seen corresponding path program 1 times [2020-12-23 11:40:31,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:40:31,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853799931] [2020-12-23 11:40:31,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:40:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:40:34,243 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-12-23 11:40:34,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853799931] [2020-12-23 11:40:34,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:40:34,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 11:40:34,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000255391] [2020-12-23 11:40:34,246 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 11:40:34,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:40:34,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 11:40:34,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:40:34,247 INFO L87 Difference]: Start difference. First operand 633 states and 807 transitions. Second operand 5 states. [2020-12-23 11:40:38,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:40:38,522 INFO L93 Difference]: Finished difference Result 858 states and 1081 transitions. [2020-12-23 11:40:38,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:40:38,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2020-12-23 11:40:38,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:40:38,529 INFO L225 Difference]: With dead ends: 858 [2020-12-23 11:40:38,529 INFO L226 Difference]: Without dead ends: 500 [2020-12-23 11:40:38,530 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:40:38,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2020-12-23 11:40:38,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 476. [2020-12-23 11:40:38,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2020-12-23 11:40:38,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 593 transitions. [2020-12-23 11:40:38,584 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 593 transitions. Word has length 130 [2020-12-23 11:40:38,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:40:38,585 INFO L481 AbstractCegarLoop]: Abstraction has 476 states and 593 transitions. [2020-12-23 11:40:38,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 11:40:38,585 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 593 transitions. [2020-12-23 11:40:38,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-12-23 11:40:38,586 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:40:38,586 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:40:38,587 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 11:40:38,587 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:40:38,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:40:38,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1213724617, now seen corresponding path program 1 times [2020-12-23 11:40:38,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:40:38,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983069316] [2020-12-23 11:40:38,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:40:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:40:47,873 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-12-23 11:40:47,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983069316] [2020-12-23 11:40:47,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:40:47,874 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:40:47,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920910350] [2020-12-23 11:40:47,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 11:40:47,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:40:47,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 11:40:47,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 11:40:47,875 INFO L87 Difference]: Start difference. First operand 476 states and 593 transitions. Second operand 4 states. [2020-12-23 11:40:48,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:40:48,553 INFO L93 Difference]: Finished difference Result 921 states and 1133 transitions. [2020-12-23 11:40:48,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 11:40:48,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2020-12-23 11:40:48,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:40:48,556 INFO L225 Difference]: With dead ends: 921 [2020-12-23 11:40:48,557 INFO L226 Difference]: Without dead ends: 562 [2020-12-23 11:40:48,557 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 11:40:48,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-12-23 11:40:48,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 500. [2020-12-23 11:40:48,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2020-12-23 11:40:48,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 617 transitions. [2020-12-23 11:40:48,612 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 617 transitions. Word has length 131 [2020-12-23 11:40:48,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:40:48,612 INFO L481 AbstractCegarLoop]: Abstraction has 500 states and 617 transitions. [2020-12-23 11:40:48,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 11:40:48,612 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 617 transitions. [2020-12-23 11:40:48,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-12-23 11:40:48,614 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:40:48,614 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:40:48,614 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 11:40:48,614 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:40:48,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:40:48,615 INFO L82 PathProgramCache]: Analyzing trace with hash 245588611, now seen corresponding path program 1 times [2020-12-23 11:40:48,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:40:48,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126316283] [2020-12-23 11:40:48,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:41:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:41:26,773 WARN L197 SmtUtils]: Spent 773.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 85 [2020-12-23 11:41:27,987 WARN L197 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 253 DAG size of output: 120 [2020-12-23 11:41:29,576 WARN L197 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 278 DAG size of output: 143 [2020-12-23 11:41:31,249 WARN L197 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 320 DAG size of output: 166 [2020-12-23 11:41:32,838 WARN L197 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 312 DAG size of output: 163 [2020-12-23 11:41:34,475 WARN L197 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 311 DAG size of output: 159 [2020-12-23 11:41:36,402 WARN L197 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 317 DAG size of output: 169 [2020-12-23 11:41:38,839 WARN L197 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 380 DAG size of output: 205 [2020-12-23 11:41:41,575 WARN L197 SmtUtils]: Spent 2.54 s on a formula simplification. DAG size of input: 409 DAG size of output: 215 [2020-12-23 11:41:44,199 WARN L197 SmtUtils]: Spent 2.39 s on a formula simplification. DAG size of input: 403 DAG size of output: 211 [2020-12-23 11:41:46,660 WARN L197 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 357 DAG size of output: 202 [2020-12-23 11:41:49,414 WARN L197 SmtUtils]: Spent 2.41 s on a formula simplification. DAG size of input: 362 DAG size of output: 204 [2020-12-23 11:41:50,857 WARN L197 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 308 DAG size of output: 143 [2020-12-23 11:41:52,859 WARN L197 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 334 DAG size of output: 165 [2020-12-23 11:41:54,820 WARN L197 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 325 DAG size of output: 154 [2020-12-23 11:41:56,749 WARN L197 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 324 DAG size of output: 147 [2020-12-23 11:41:59,578 WARN L197 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 384 DAG size of output: 161 [2020-12-23 11:42:02,286 WARN L197 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 378 DAG size of output: 164 [2020-12-23 11:42:04,803 WARN L197 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 387 DAG size of output: 166 [2020-12-23 11:42:06,554 WARN L197 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 291 DAG size of output: 145 [2020-12-23 11:42:08,146 WARN L197 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 269 DAG size of output: 129