/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_fib-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 11:37:56,081 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 11:37:56,085 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 11:37:56,139 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 11:37:56,140 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 11:37:56,144 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 11:37:56,148 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 11:37:56,154 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 11:37:56,157 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 11:37:56,163 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 11:37:56,167 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 11:37:56,169 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 11:37:56,170 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 11:37:56,173 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 11:37:56,175 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 11:37:56,177 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 11:37:56,178 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 11:37:56,182 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 11:37:56,196 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 11:37:56,201 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 11:37:56,203 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 11:37:56,207 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 11:37:56,208 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 11:37:56,209 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 11:37:56,211 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 11:37:56,212 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 11:37:56,212 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 11:37:56,213 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 11:37:56,213 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 11:37:56,214 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 11:37:56,215 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 11:37:56,216 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 11:37:56,216 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 11:37:56,217 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 11:37:56,218 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 11:37:56,219 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 11:37:56,219 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 11:37:56,220 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 11:37:56,220 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 11:37:56,221 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 11:37:56,222 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 11:37:56,223 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:37:56,250 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 11:37:56,251 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 11:37:56,252 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 11:37:56,252 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 11:37:56,253 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 11:37:56,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 11:37:56,253 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 11:37:56,253 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 11:37:56,253 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 11:37:56,254 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 11:37:56,254 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 11:37:56,254 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 11:37:56,254 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 11:37:56,254 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 11:37:56,255 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 11:37:56,255 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 11:37:56,255 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 11:37:56,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 11:37:56,255 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 11:37:56,256 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 11:37:56,256 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 11:37:56,256 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 11:37:56,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 11:37:56,256 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 11:37:56,257 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 11:37:56,257 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:37:56,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 11:37:56,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 11:37:56,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 11:37:56,650 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 11:37:56,651 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 11:37:56,652 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_fib-2.i [2020-12-23 11:37:56,739 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/bc9a3071d/3c46b27b1a594ba1883ef184bfa964d7/FLAG457aa9bd7 [2020-12-23 11:37:57,466 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 11:37:57,467 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_fib-2.i [2020-12-23 11:37:57,502 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/bc9a3071d/3c46b27b1a594ba1883ef184bfa964d7/FLAG457aa9bd7 [2020-12-23 11:37:57,739 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/bc9a3071d/3c46b27b1a594ba1883ef184bfa964d7 [2020-12-23 11:37:57,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 11:37:57,745 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 11:37:57,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 11:37:57,747 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 11:37:57,754 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 11:37:57,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 11:37:57" (1/1) ... [2020-12-23 11:37:57,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38380b37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:37:57, skipping insertion in model container [2020-12-23 11:37:57,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 11:37:57" (1/1) ... [2020-12-23 11:37:57,765 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 11:37:57,855 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 11:37:58,206 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_fib-2.i[23457,23470] 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_error_detail~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: lhs: VariableLHS[~__CS_error_detail~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: lhs: VariableLHS[~__CS_error_detail~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_error_detail~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_error_detail~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_error_detail~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: VariableLHS[~k~1,] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~__CS_u~0,GLOBAL],i],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~i~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: lhs: VariableLHS[~k~2,] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[VariableLHS[~__CS_u~0,GLOBAL],j],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~j~2,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error_detail~0,GLOBAL] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_cp___CS_thread_status~0,],[IdentifierExpression[~i~1,]]],[IdentifierExpression[~j~3,]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_cp___CS_thread_lockedon~0,],[IdentifierExpression[~i~1,]]],[IdentifierExpression[~j~3,]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_cp_i~0,],[IdentifierExpression[~i~1,]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_cp_j~0,],[IdentifierExpression[~i~1,]]] 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[3]]],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[IntegerLiteral[4]]],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[IntegerLiteral[5]]],[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[3]]],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[IntegerLiteral[4]]],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[IntegerLiteral[5]]],[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_status~0,GLOBAL],[IntegerLiteral[3]]],[IntegerLiteral[2]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[IntegerLiteral[4]]],[IntegerLiteral[2]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[IntegerLiteral[5]]],[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[3]]],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_lockedon~0,GLOBAL],[IntegerLiteral[4]]],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_lockedon~0,GLOBAL],[IntegerLiteral[5]]],[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[3]]],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_lockedon~0,GLOBAL],[IntegerLiteral[4]]],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_lockedon~0,GLOBAL],[IntegerLiteral[5]]],[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[ArrayLHS[VariableLHS[~__CS_thread_lockedon~0,GLOBAL],[IntegerLiteral[3]]],[IntegerLiteral[2]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_lockedon~0,GLOBAL],[IntegerLiteral[4]]],[IntegerLiteral[2]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_lockedon~0,GLOBAL],[IntegerLiteral[5]]],[IntegerLiteral[2]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~i~0,GLOBAL],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~i~0,GLOBAL],[IntegerLiteral[2]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~i~0,GLOBAL],[IntegerLiteral[3]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~i~0,GLOBAL],[IntegerLiteral[4]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~i~0,GLOBAL],[IntegerLiteral[5]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~j~2,GLOBAL],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~j~2,GLOBAL],[IntegerLiteral[2]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~j~2,GLOBAL],[IntegerLiteral[3]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~j~2,GLOBAL],[IntegerLiteral[4]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~j~2,GLOBAL],[IntegerLiteral[5]]] 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:37:58,359 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 11:37:58,389 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 11:37:58,454 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_fib-2.i[23457,23470] 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_error_detail~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: lhs: VariableLHS[~__CS_error_detail~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: lhs: VariableLHS[~__CS_error_detail~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_error_detail~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_error_detail~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_error_detail~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: lhs: VariableLHS[~k~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_u~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_u~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#i~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#i~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]]]] left hand side expression in assignment: lhs: VariableLHS[~k~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_u~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_u~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#j~2,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#j~2,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error_detail~0,GLOBAL] 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~1,]]],IdentifierExpression[~j~3,]]]] 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~1,]]],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~j~3,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_cp_i~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_cp_i~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~1,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_cp_j~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_cp_j~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~1,]]]]] 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[9],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[12],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[15],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[10],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[13],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[16],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_status~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11],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[14],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[17],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[72],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[96],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[120],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[80],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[104],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[128],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[~#__CS_thread_lockedon~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],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[112],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[136],StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#i~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#i~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#i~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#i~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#i~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~#i~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#i~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~#i~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#i~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~#i~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#j~2,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#j~2,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#j~2,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#j~2,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#j~2,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~#j~2,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#j~2,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~#j~2,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#j~2,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~#j~2,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:37:58,553 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 11:37:58,691 INFO L208 MainTranslator]: Completed translation [2020-12-23 11:37:58,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:37:58 WrapperNode [2020-12-23 11:37:58,691 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 11:37:58,693 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 11:37:58,693 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 11:37:58,693 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 11:37:58,701 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:37:58" (1/1) ... [2020-12-23 11:37:58,743 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:37:58" (1/1) ... [2020-12-23 11:37:58,880 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 11:37:58,884 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 11:37:58,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 11:37:58,886 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 11:37:58,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:37:58" (1/1) ... [2020-12-23 11:37:58,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:37:58" (1/1) ... [2020-12-23 11:37:58,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:37:58" (1/1) ... [2020-12-23 11:37:58,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:37:58" (1/1) ... [2020-12-23 11:37:59,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:37:58" (1/1) ... [2020-12-23 11:37:59,078 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:37:58" (1/1) ... [2020-12-23 11:37:59,088 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:37:58" (1/1) ... [2020-12-23 11:37:59,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 11:37:59,106 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 11:37:59,106 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 11:37:59,107 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 11:37:59,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:37:58" (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:37:59,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 11:37:59,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 11:37:59,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 11:37:59,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 11:37:59,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 11:37:59,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 11:37:59,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 11:37:59,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 11:37:59,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 11:37:59,629 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 11:37:59,630 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 11:37:59,653 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 11:37:59,654 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 11:37:59,671 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 11:37:59,676 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 11:38:05,638 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L571-4: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0.base, main_thread_~#id1~0.offset);havoc main_thread_~#id1~0.base, main_thread_~#id1~0.offset;call ULTIMATE.dealloc(main_thread_~#id2~0.base, main_thread_~#id2~0.offset);havoc main_thread_~#id2~0.base, main_thread_~#id2~0.offset; [2020-12-23 11:38:05,638 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L571-4: assume !(0 != ~__CS_ret~0 % 256); [2020-12-23 11:38:05,638 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L571-5: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0.base, main_thread_~#id1~0.offset);havoc main_thread_~#id1~0.base, main_thread_~#id1~0.offset;call ULTIMATE.dealloc(main_thread_~#id2~0.base, main_thread_~#id2~0.offset);havoc main_thread_~#id2~0.base, main_thread_~#id2~0.offset; [2020-12-23 11:38:05,639 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L571-5: assume !(0 != ~__CS_ret~0 % 256);havoc __CS_cs_#t~nondet5, __CS_cs_#t~nondet6, __CS_cs_#t~ite7, __CS_cs_~k~0;__CS_cs_~k~0 := __CS_cs_#t~nondet5;havoc __CS_cs_#t~nondet5;assume_abort_if_not_#in~cond := (if ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 6 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; [2020-12-23 11:38:05,639 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L571-6: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0.base, main_thread_~#id1~0.offset);havoc main_thread_~#id1~0.base, main_thread_~#id1~0.offset;call ULTIMATE.dealloc(main_thread_~#id2~0.base, main_thread_~#id2~0.offset);havoc main_thread_~#id2~0.base, main_thread_~#id2~0.offset; [2020-12-23 11:38:05,639 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L571-6: assume !(0 != ~__CS_ret~0 % 256); [2020-12-23 11:38:05,639 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L571-20: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0.base, main_thread_~#id1~0.offset);havoc main_thread_~#id1~0.base, main_thread_~#id1~0.offset;call ULTIMATE.dealloc(main_thread_~#id2~0.base, main_thread_~#id2~0.offset);havoc main_thread_~#id2~0.base, main_thread_~#id2~0.offset; [2020-12-23 11:38:05,639 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L571-20: assume !(0 != ~__CS_ret~0 % 256); [2020-12-23 11:38:05,640 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L571-21: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0.base, main_thread_~#id1~0.offset);havoc main_thread_~#id1~0.base, main_thread_~#id1~0.offset;call ULTIMATE.dealloc(main_thread_~#id2~0.base, main_thread_~#id2~0.offset);havoc main_thread_~#id2~0.base, main_thread_~#id2~0.offset; [2020-12-23 11:38:05,640 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L571-21: assume !(0 != ~__CS_ret~0 % 256);havoc __CS_cs_#t~nondet5, __CS_cs_#t~nondet6, __CS_cs_#t~ite7, __CS_cs_~k~0;__CS_cs_~k~0 := __CS_cs_#t~nondet5;havoc __CS_cs_#t~nondet5;assume_abort_if_not_#in~cond := (if ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 6 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; [2020-12-23 11:38:05,640 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L571-22: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0.base, main_thread_~#id1~0.offset);havoc main_thread_~#id1~0.base, main_thread_~#id1~0.offset;call ULTIMATE.dealloc(main_thread_~#id2~0.base, main_thread_~#id2~0.offset);havoc main_thread_~#id2~0.base, main_thread_~#id2~0.offset; [2020-12-23 11:38:05,640 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L571-22: assume !(0 != ~__CS_ret~0 % 256); [2020-12-23 11:38:05,641 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L571-36: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0.base, main_thread_~#id1~0.offset);havoc main_thread_~#id1~0.base, main_thread_~#id1~0.offset;call ULTIMATE.dealloc(main_thread_~#id2~0.base, main_thread_~#id2~0.offset);havoc main_thread_~#id2~0.base, main_thread_~#id2~0.offset; [2020-12-23 11:38:05,641 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L571-36: assume !(0 != ~__CS_ret~0 % 256); [2020-12-23 11:38:05,641 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L571-37: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0.base, main_thread_~#id1~0.offset);havoc main_thread_~#id1~0.base, main_thread_~#id1~0.offset;call ULTIMATE.dealloc(main_thread_~#id2~0.base, main_thread_~#id2~0.offset);havoc main_thread_~#id2~0.base, main_thread_~#id2~0.offset; [2020-12-23 11:38:05,641 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L571-37: assume !(0 != ~__CS_ret~0 % 256);havoc __CS_cs_#t~nondet5, __CS_cs_#t~nondet6, __CS_cs_#t~ite7, __CS_cs_~k~0;__CS_cs_~k~0 := __CS_cs_#t~nondet5;havoc __CS_cs_#t~nondet5;assume_abort_if_not_#in~cond := (if ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 6 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; [2020-12-23 11:38:05,641 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L571-38: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0.base, main_thread_~#id1~0.offset);havoc main_thread_~#id1~0.base, main_thread_~#id1~0.offset;call ULTIMATE.dealloc(main_thread_~#id2~0.base, main_thread_~#id2~0.offset);havoc main_thread_~#id2~0.base, main_thread_~#id2~0.offset; [2020-12-23 11:38:05,642 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L571-38: assume !(0 != ~__CS_ret~0 % 256); [2020-12-23 11:38:05,642 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L576-12: assume 0 != __CS_cs_#t~nondet6 && 5 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2020-12-23 11:38:05,642 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L576-12: assume !(0 != __CS_cs_#t~nondet6 && 5 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2020-12-23 11:38:05,642 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L576-14: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2020-12-23 11:38:05,642 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L576-15: assume 0 != __CS_cs_#t~nondet6 && 5 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2020-12-23 11:38:05,642 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L576-15: assume !(0 != __CS_cs_#t~nondet6 && 5 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2020-12-23 11:38:05,643 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L576-17: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2020-12-23 11:38:05,643 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L576-18: assume 0 != __CS_cs_#t~nondet6 && 5 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2020-12-23 11:38:05,643 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L576-18: assume !(0 != __CS_cs_#t~nondet6 && 5 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2020-12-23 11:38:05,643 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L576-20: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2020-12-23 11:38:05,643 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L576-60: assume 0 != __CS_cs_#t~nondet6 && 5 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2020-12-23 11:38:05,643 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L576-60: assume !(0 != __CS_cs_#t~nondet6 && 5 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2020-12-23 11:38:05,644 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L576-62: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2020-12-23 11:38:05,644 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L576-63: assume 0 != __CS_cs_#t~nondet6 && 5 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2020-12-23 11:38:05,644 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L576-63: assume !(0 != __CS_cs_#t~nondet6 && 5 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2020-12-23 11:38:05,644 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L576-65: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2020-12-23 11:38:05,644 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L576-66: assume 0 != __CS_cs_#t~nondet6 && 5 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2020-12-23 11:38:05,645 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L576-66: assume !(0 != __CS_cs_#t~nondet6 && 5 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2020-12-23 11:38:05,645 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L576-68: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2020-12-23 11:38:05,645 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L576-108: assume 0 != __CS_cs_#t~nondet6 && 5 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2020-12-23 11:38:05,645 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L576-108: assume !(0 != __CS_cs_#t~nondet6 && 5 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2020-12-23 11:38:05,645 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L576-110: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2020-12-23 11:38:05,645 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L576-111: assume 0 != __CS_cs_#t~nondet6 && 5 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2020-12-23 11:38:05,646 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L576-111: assume !(0 != __CS_cs_#t~nondet6 && 5 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2020-12-23 11:38:05,646 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L576-113: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2020-12-23 11:38:05,646 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L576-114: assume 0 != __CS_cs_#t~nondet6 && 5 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2020-12-23 11:38:05,646 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L576-114: assume !(0 != __CS_cs_#t~nondet6 && 5 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2020-12-23 11:38:05,646 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L576-116: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2020-12-23 11:38:05,646 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##205: assume !(0 == assume_abort_if_not_~cond); [2020-12-23 11:38:05,647 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##204: assume 0 == assume_abort_if_not_~cond;assume false; [2020-12-23 11:38:05,647 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##212: assume !(0 == assume_abort_if_not_~cond); [2020-12-23 11:38:05,647 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##211: assume 0 == assume_abort_if_not_~cond;assume false; [2020-12-23 11:38:05,647 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L2-4: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;assume -2147483648 <= __CS_cs_#t~nondet6 && __CS_cs_#t~nondet6 <= 2147483647; [2020-12-23 11:38:05,647 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L2-5: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;assume -2147483648 <= __CS_cs_#t~nondet6 && __CS_cs_#t~nondet6 <= 2147483647; [2020-12-23 11:38:05,648 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L2-6: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;assume -2147483648 <= __CS_cs_#t~nondet6 && __CS_cs_#t~nondet6 <= 2147483647; [2020-12-23 11:38:05,648 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L2-20: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;assume -2147483648 <= __CS_cs_#t~nondet6 && __CS_cs_#t~nondet6 <= 2147483647; [2020-12-23 11:38:05,648 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L2-21: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;assume -2147483648 <= __CS_cs_#t~nondet6 && __CS_cs_#t~nondet6 <= 2147483647; [2020-12-23 11:38:05,648 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L2-22: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;assume -2147483648 <= __CS_cs_#t~nondet6 && __CS_cs_#t~nondet6 <= 2147483647; [2020-12-23 11:38:05,648 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L2-36: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;assume -2147483648 <= __CS_cs_#t~nondet6 && __CS_cs_#t~nondet6 <= 2147483647; [2020-12-23 11:38:05,648 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L2-37: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;assume -2147483648 <= __CS_cs_#t~nondet6 && __CS_cs_#t~nondet6 <= 2147483647; [2020-12-23 11:38:05,649 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L2-38: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;assume -2147483648 <= __CS_cs_#t~nondet6 && __CS_cs_#t~nondet6 <= 2147483647; [2020-12-23 11:38:05,649 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L3-8: assume 0 == assume_abort_if_not_~cond;assume false; [2020-12-23 11:38:05,649 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L3-8: assume !(0 == assume_abort_if_not_~cond); [2020-12-23 11:38:05,649 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L3-36: assume 0 == assume_abort_if_not_~cond;assume false; [2020-12-23 11:38:05,649 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L3-36: assume !(0 == assume_abort_if_not_~cond); [2020-12-23 11:38:05,650 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L3-64: assume 0 == assume_abort_if_not_~cond;assume false; [2020-12-23 11:38:05,650 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L3-64: assume !(0 == assume_abort_if_not_~cond); [2020-12-23 11:38:05,650 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##61: assume 0 == assume_abort_if_not_~cond;assume false; [2020-12-23 11:38:05,650 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##62: assume !(0 == assume_abort_if_not_~cond); [2020-12-23 11:38:05,650 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##54: assume 0 == assume_abort_if_not_~cond;assume false; [2020-12-23 11:38:05,651 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume !(0 == assume_abort_if_not_~cond); [2020-12-23 11:38:05,651 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##355: assume !(0 == assume_abort_if_not_~cond); [2020-12-23 11:38:05,651 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##354: assume 0 == assume_abort_if_not_~cond;assume false; [2020-12-23 11:38:05,651 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##362: assume !(0 == assume_abort_if_not_~cond); [2020-12-23 11:38:05,651 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##361: assume 0 == assume_abort_if_not_~cond;assume false; [2020-12-23 11:38:05,667 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 11:38:05,667 INFO L299 CfgBuilder]: Removed 334 assume(true) statements. [2020-12-23 11:38:05,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 11:38:05 BoogieIcfgContainer [2020-12-23 11:38:05,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 11:38:05,677 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 11:38:05,677 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 11:38:05,681 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 11:38:05,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 11:37:57" (1/3) ... [2020-12-23 11:38:05,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@227400f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 11:38:05, skipping insertion in model container [2020-12-23 11:38:05,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:37:58" (2/3) ... [2020-12-23 11:38:05,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@227400f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 11:38:05, skipping insertion in model container [2020-12-23 11:38:05,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 11:38:05" (3/3) ... [2020-12-23 11:38:05,685 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_fib-2.i [2020-12-23 11:38:05,692 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 11:38:05,698 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2020-12-23 11:38:05,717 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-12-23 11:38:05,750 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 11:38:05,750 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 11:38:05,750 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 11:38:05,751 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 11:38:05,751 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 11:38:05,751 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 11:38:05,751 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 11:38:05,751 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 11:38:05,781 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states. [2020-12-23 11:38:05,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-12-23 11:38:05,800 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:38:05,801 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,801 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:38:05,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:38:05,809 INFO L82 PathProgramCache]: Analyzing trace with hash 306120471, now seen corresponding path program 1 times [2020-12-23 11:38:05,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:38:05,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981568211] [2020-12-23 11:38:05,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:38:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:06,413 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:06,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981568211] [2020-12-23 11:38:06,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:38:06,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:38:06,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467166752] [2020-12-23 11:38:06,421 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:38:06,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:38:06,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:38:06,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:38:06,440 INFO L87 Difference]: Start difference. First operand 392 states. Second operand 3 states. [2020-12-23 11:38:06,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:38:06,563 INFO L93 Difference]: Finished difference Result 787 states and 1209 transitions. [2020-12-23 11:38:06,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:38:06,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2020-12-23 11:38:06,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:38:06,588 INFO L225 Difference]: With dead ends: 787 [2020-12-23 11:38:06,588 INFO L226 Difference]: Without dead ends: 393 [2020-12-23 11:38:06,594 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:06,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2020-12-23 11:38:06,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 389. [2020-12-23 11:38:06,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-12-23 11:38:06,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 504 transitions. [2020-12-23 11:38:06,682 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 504 transitions. Word has length 92 [2020-12-23 11:38:06,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:38:06,688 INFO L481 AbstractCegarLoop]: Abstraction has 389 states and 504 transitions. [2020-12-23 11:38:06,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:38:06,689 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 504 transitions. [2020-12-23 11:38:06,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-12-23 11:38:06,696 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:38:06,696 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,696 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 11:38:06,697 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:38:06,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:38:06,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1940473127, now seen corresponding path program 1 times [2020-12-23 11:38:06,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:38:06,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890725969] [2020-12-23 11:38:06,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:38:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:06,894 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:06,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890725969] [2020-12-23 11:38:06,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:38:06,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:38:06,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572680765] [2020-12-23 11:38:06,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:38:06,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:38:06,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:38:06,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:38:06,901 INFO L87 Difference]: Start difference. First operand 389 states and 504 transitions. Second operand 3 states. [2020-12-23 11:38:06,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:38:06,947 INFO L93 Difference]: Finished difference Result 777 states and 1008 transitions. [2020-12-23 11:38:06,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:38:06,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2020-12-23 11:38:06,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:38:06,952 INFO L225 Difference]: With dead ends: 777 [2020-12-23 11:38:06,952 INFO L226 Difference]: Without dead ends: 391 [2020-12-23 11:38:06,954 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:06,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2020-12-23 11:38:06,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 390. [2020-12-23 11:38:06,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-12-23 11:38:06,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 505 transitions. [2020-12-23 11:38:06,976 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 505 transitions. Word has length 96 [2020-12-23 11:38:06,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:38:06,976 INFO L481 AbstractCegarLoop]: Abstraction has 390 states and 505 transitions. [2020-12-23 11:38:06,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:38:06,976 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 505 transitions. [2020-12-23 11:38:06,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-23 11:38:06,980 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:38:06,980 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,980 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 11:38:06,980 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:38:06,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:38:06,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1103101335, now seen corresponding path program 1 times [2020-12-23 11:38:06,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:38:06,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957851916] [2020-12-23 11:38:06,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:38:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:07,093 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:07,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957851916] [2020-12-23 11:38:07,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766388047] [2020-12-23 11:38:07,094 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:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:07,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 11:38:07,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 11:38:07,964 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:07,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 11:38:07,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-12-23 11:38:07,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362649680] [2020-12-23 11:38:07,967 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 11:38:07,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:38:07,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 11:38:07,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:38:07,968 INFO L87 Difference]: Start difference. First operand 390 states and 505 transitions. Second operand 5 states. [2020-12-23 11:38:08,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:38:08,034 INFO L93 Difference]: Finished difference Result 780 states and 1011 transitions. [2020-12-23 11:38:08,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 11:38:08,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2020-12-23 11:38:08,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:38:08,038 INFO L225 Difference]: With dead ends: 780 [2020-12-23 11:38:08,038 INFO L226 Difference]: Without dead ends: 393 [2020-12-23 11:38:08,040 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 98 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:08,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2020-12-23 11:38:08,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 392. [2020-12-23 11:38:08,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-12-23 11:38:08,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 507 transitions. [2020-12-23 11:38:08,059 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 507 transitions. Word has length 98 [2020-12-23 11:38:08,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:38:08,059 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 507 transitions. [2020-12-23 11:38:08,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 11:38:08,060 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 507 transitions. [2020-12-23 11:38:08,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-23 11:38:08,062 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:38:08,063 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:38:08,276 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-12-23 11:38:08,277 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:38:08,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:38:08,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1105430741, now seen corresponding path program 2 times [2020-12-23 11:38:08,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:38:08,280 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727228804] [2020-12-23 11:38:08,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:38:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:08,503 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:08,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727228804] [2020-12-23 11:38:08,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210292504] [2020-12-23 11:38:08,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 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:11,017 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 11:38:11,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 11:38:11,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 11:38:11,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 11:38:11,144 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:11,144 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 11:38:11,144 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-12-23 11:38:11,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538756294] [2020-12-23 11:38:11,145 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:38:11,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:38:11,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:38:11,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:38:11,153 INFO L87 Difference]: Start difference. First operand 392 states and 507 transitions. Second operand 3 states. [2020-12-23 11:38:11,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:38:11,210 INFO L93 Difference]: Finished difference Result 682 states and 872 transitions. [2020-12-23 11:38:11,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:38:11,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2020-12-23 11:38:11,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:38:11,214 INFO L225 Difference]: With dead ends: 682 [2020-12-23 11:38:11,214 INFO L226 Difference]: Without dead ends: 392 [2020-12-23 11:38:11,216 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 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:11,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2020-12-23 11:38:11,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2020-12-23 11:38:11,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-12-23 11:38:11,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 506 transitions. [2020-12-23 11:38:11,236 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 506 transitions. Word has length 100 [2020-12-23 11:38:11,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:38:11,237 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 506 transitions. [2020-12-23 11:38:11,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:38:11,237 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 506 transitions. [2020-12-23 11:38:11,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-12-23 11:38:11,239 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:38:11,239 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:38:11,452 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:38:11,453 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:38:11,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:38:11,454 INFO L82 PathProgramCache]: Analyzing trace with hash -636186260, now seen corresponding path program 1 times [2020-12-23 11:38:11,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:38:11,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784911150] [2020-12-23 11:38:11,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:38:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:11,577 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:11,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784911150] [2020-12-23 11:38:11,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262274373] [2020-12-23 11:38:11,578 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:11,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:11,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 11:38:11,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 11:38:12,066 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:12,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 11:38:12,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2020-12-23 11:38:12,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360010644] [2020-12-23 11:38:12,068 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 11:38:12,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:38:12,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 11:38:12,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-23 11:38:12,069 INFO L87 Difference]: Start difference. First operand 392 states and 506 transitions. Second operand 7 states. [2020-12-23 11:38:12,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:38:12,432 INFO L93 Difference]: Finished difference Result 802 states and 1036 transitions. [2020-12-23 11:38:12,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-23 11:38:12,434 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 110 [2020-12-23 11:38:12,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:38:12,436 INFO L225 Difference]: With dead ends: 802 [2020-12-23 11:38:12,437 INFO L226 Difference]: Without dead ends: 413 [2020-12-23 11:38:12,438 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2020-12-23 11:38:12,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2020-12-23 11:38:12,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 404. [2020-12-23 11:38:12,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2020-12-23 11:38:12,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 519 transitions. [2020-12-23 11:38:12,450 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 519 transitions. Word has length 110 [2020-12-23 11:38:12,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:38:12,450 INFO L481 AbstractCegarLoop]: Abstraction has 404 states and 519 transitions. [2020-12-23 11:38:12,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 11:38:12,451 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 519 transitions. [2020-12-23 11:38:12,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2020-12-23 11:38:12,453 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:38:12,453 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:38:12,668 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:38:12,669 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:38:12,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:38:12,671 INFO L82 PathProgramCache]: Analyzing trace with hash 704873388, now seen corresponding path program 2 times [2020-12-23 11:38:12,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:38:12,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581101657] [2020-12-23 11:38:12,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:38:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:13,005 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-12-23 11:38:13,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581101657] [2020-12-23 11:38:13,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265094556] [2020-12-23 11:38:13,006 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:38:16,177 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 11:38:16,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 11:38:16,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-23 11:38:16,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 11:38:16,644 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2020-12-23 11:38:16,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 11:38:16,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2020-12-23 11:38:16,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574002865] [2020-12-23 11:38:16,646 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 11:38:16,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:38:16,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 11:38:16,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-23 11:38:16,647 INFO L87 Difference]: Start difference. First operand 404 states and 519 transitions. Second operand 5 states. [2020-12-23 11:38:16,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:38:16,843 INFO L93 Difference]: Finished difference Result 698 states and 889 transitions. [2020-12-23 11:38:16,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:38:16,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2020-12-23 11:38:16,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:38:16,852 INFO L225 Difference]: With dead ends: 698 [2020-12-23 11:38:16,853 INFO L226 Difference]: Without dead ends: 696 [2020-12-23 11:38:16,856 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-12-23 11:38:16,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2020-12-23 11:38:16,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 670. [2020-12-23 11:38:16,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2020-12-23 11:38:16,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 862 transitions. [2020-12-23 11:38:16,889 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 862 transitions. Word has length 122 [2020-12-23 11:38:16,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:38:16,890 INFO L481 AbstractCegarLoop]: Abstraction has 670 states and 862 transitions. [2020-12-23 11:38:16,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 11:38:16,890 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 862 transitions. [2020-12-23 11:38:16,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-12-23 11:38:16,898 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:38:16,899 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:38:17,099 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:38:17,100 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:38:17,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:38:17,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1221301873, now seen corresponding path program 1 times [2020-12-23 11:38:17,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:38:17,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731580855] [2020-12-23 11:38:17,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:38:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:17,303 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-12-23 11:38:17,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731580855] [2020-12-23 11:38:17,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883602969] [2020-12-23 11:38:17,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:38:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:17,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 878 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 11:38:17,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 11:38:17,847 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-12-23 11:38:17,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 11:38:17,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-12-23 11:38:17,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82434215] [2020-12-23 11:38:17,849 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 11:38:17,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:38:17,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 11:38:17,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 11:38:17,851 INFO L87 Difference]: Start difference. First operand 670 states and 862 transitions. Second operand 6 states. [2020-12-23 11:38:17,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:38:17,953 INFO L93 Difference]: Finished difference Result 1336 states and 1720 transitions. [2020-12-23 11:38:17,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:38:17,955 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2020-12-23 11:38:17,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:38:17,959 INFO L225 Difference]: With dead ends: 1336 [2020-12-23 11:38:17,959 INFO L226 Difference]: Without dead ends: 689 [2020-12-23 11:38:17,961 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 124 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:17,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2020-12-23 11:38:17,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 680. [2020-12-23 11:38:17,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2020-12-23 11:38:17,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 873 transitions. [2020-12-23 11:38:17,985 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 873 transitions. Word has length 124 [2020-12-23 11:38:17,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:38:17,985 INFO L481 AbstractCegarLoop]: Abstraction has 680 states and 873 transitions. [2020-12-23 11:38:17,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 11:38:17,986 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 873 transitions. [2020-12-23 11:38:17,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-12-23 11:38:17,988 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:38:17,988 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 3, 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:38:18,201 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-12-23 11:38:18,202 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:38:18,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:38:18,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1248119441, now seen corresponding path program 2 times [2020-12-23 11:38:18,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:38:18,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34784273] [2020-12-23 11:38:18,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:38:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:18,524 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-12-23 11:38:18,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34784273] [2020-12-23 11:38:18,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013762538] [2020-12-23 11:38:18,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:38:22,260 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 11:38:22,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 11:38:22,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-23 11:38:22,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 11:38:22,729 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2020-12-23 11:38:22,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 11:38:22,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2020-12-23 11:38:22,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808814659] [2020-12-23 11:38:22,730 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 11:38:22,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:38:22,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 11:38:22,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-12-23 11:38:22,732 INFO L87 Difference]: Start difference. First operand 680 states and 873 transitions. Second operand 7 states. [2020-12-23 11:38:23,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:38:23,038 INFO L93 Difference]: Finished difference Result 706 states and 898 transitions. [2020-12-23 11:38:23,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:38:23,039 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 134 [2020-12-23 11:38:23,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:38:23,043 INFO L225 Difference]: With dead ends: 706 [2020-12-23 11:38:23,043 INFO L226 Difference]: Without dead ends: 704 [2020-12-23 11:38:23,044 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-12-23 11:38:23,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2020-12-23 11:38:23,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 682. [2020-12-23 11:38:23,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2020-12-23 11:38:23,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 875 transitions. [2020-12-23 11:38:23,064 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 875 transitions. Word has length 134 [2020-12-23 11:38:23,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:38:23,065 INFO L481 AbstractCegarLoop]: Abstraction has 682 states and 875 transitions. [2020-12-23 11:38:23,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 11:38:23,065 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 875 transitions. [2020-12-23 11:38:23,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-12-23 11:38:23,068 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:38:23,068 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 3, 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, 1, 1] [2020-12-23 11:38:23,269 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:38:23,269 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:38:23,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:38:23,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1147112596, now seen corresponding path program 1 times [2020-12-23 11:38:23,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:38:23,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562597336] [2020-12-23 11:38:23,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:38:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:23,509 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-12-23 11:38:23,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562597336] [2020-12-23 11:38:23,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659729534] [2020-12-23 11:38:23,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:38:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:23,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 922 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 11:38:23,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 11:38:23,962 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-12-23 11:38:23,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 11:38:23,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-12-23 11:38:23,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746010792] [2020-12-23 11:38:23,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 11:38:23,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:38:23,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 11:38:23,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-12-23 11:38:23,965 INFO L87 Difference]: Start difference. First operand 682 states and 875 transitions. Second operand 7 states. [2020-12-23 11:38:24,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:38:24,107 INFO L93 Difference]: Finished difference Result 1350 states and 1735 transitions. [2020-12-23 11:38:24,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 11:38:24,108 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 136 [2020-12-23 11:38:24,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:38:24,112 INFO L225 Difference]: With dead ends: 1350 [2020-12-23 11:38:24,112 INFO L226 Difference]: Without dead ends: 701 [2020-12-23 11:38:24,113 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-12-23 11:38:24,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2020-12-23 11:38:24,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 692. [2020-12-23 11:38:24,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2020-12-23 11:38:24,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 886 transitions. [2020-12-23 11:38:24,134 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 886 transitions. Word has length 136 [2020-12-23 11:38:24,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:38:24,135 INFO L481 AbstractCegarLoop]: Abstraction has 692 states and 886 transitions. [2020-12-23 11:38:24,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 11:38:24,135 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 886 transitions. [2020-12-23 11:38:24,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-12-23 11:38:24,163 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:38:24,164 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,364 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:38:24,365 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:38:24,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:38:24,366 INFO L82 PathProgramCache]: Analyzing trace with hash 302807702, now seen corresponding path program 2 times [2020-12-23 11:38:24,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:38:24,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178839116] [2020-12-23 11:38:24,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:38:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:24,619 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-12-23 11:38:24,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178839116] [2020-12-23 11:38:24,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16790266] [2020-12-23 11:38:24,620 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:38:32,365 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 11:38:32,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 11:38:32,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 27 conjunts are in the unsatisfiable core [2020-12-23 11:38:32,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 11:38:32,930 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2020-12-23 11:38:32,931 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 11:38:32,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2020-12-23 11:38:32,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034841839] [2020-12-23 11:38:32,932 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 11:38:32,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:38:32,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 11:38:32,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2020-12-23 11:38:32,933 INFO L87 Difference]: Start difference. First operand 692 states and 886 transitions. Second operand 8 states. [2020-12-23 11:38:33,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:38:33,822 INFO L93 Difference]: Finished difference Result 714 states and 907 transitions. [2020-12-23 11:38:33,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 11:38:33,822 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 146 [2020-12-23 11:38:33,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:38:33,827 INFO L225 Difference]: With dead ends: 714 [2020-12-23 11:38:33,827 INFO L226 Difference]: Without dead ends: 712 [2020-12-23 11:38:33,827 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-12-23 11:38:33,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2020-12-23 11:38:33,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 694. [2020-12-23 11:38:33,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2020-12-23 11:38:33,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 888 transitions. [2020-12-23 11:38:33,847 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 888 transitions. Word has length 146 [2020-12-23 11:38:33,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:38:33,847 INFO L481 AbstractCegarLoop]: Abstraction has 694 states and 888 transitions. [2020-12-23 11:38:33,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 11:38:33,847 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 888 transitions. [2020-12-23 11:38:33,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-12-23 11:38:33,849 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:38:33,850 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,050 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-23 11:38:34,051 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:38:34,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:38:34,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1059368775, now seen corresponding path program 1 times [2020-12-23 11:38:34,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:38:34,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128307984] [2020-12-23 11:38:34,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:38:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:34,311 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-12-23 11:38:34,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128307984] [2020-12-23 11:38:34,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136031045] [2020-12-23 11:38:34,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:38:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:34,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 966 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-23 11:38:34,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 11:38:34,845 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-12-23 11:38:34,846 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 11:38:34,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-12-23 11:38:34,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248691469] [2020-12-23 11:38:34,847 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 11:38:34,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:38:34,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 11:38:34,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-12-23 11:38:34,848 INFO L87 Difference]: Start difference. First operand 694 states and 888 transitions. Second operand 8 states. [2020-12-23 11:38:34,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:38:34,978 INFO L93 Difference]: Finished difference Result 1364 states and 1750 transitions. [2020-12-23 11:38:34,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 11:38:34,979 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 148 [2020-12-23 11:38:34,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:38:34,983 INFO L225 Difference]: With dead ends: 1364 [2020-12-23 11:38:34,983 INFO L226 Difference]: Without dead ends: 713 [2020-12-23 11:38:34,984 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-12-23 11:38:34,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2020-12-23 11:38:35,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 704. [2020-12-23 11:38:35,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2020-12-23 11:38:35,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 899 transitions. [2020-12-23 11:38:35,032 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 899 transitions. Word has length 148 [2020-12-23 11:38:35,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:38:35,033 INFO L481 AbstractCegarLoop]: Abstraction has 704 states and 899 transitions. [2020-12-23 11:38:35,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 11:38:35,033 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 899 transitions. [2020-12-23 11:38:35,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-12-23 11:38:35,036 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:38:35,037 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,249 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:38:35,250 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:38:35,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:38:35,252 INFO L82 PathProgramCache]: Analyzing trace with hash 429476795, now seen corresponding path program 2 times [2020-12-23 11:38:35,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:38:35,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421195646] [2020-12-23 11:38:35,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:38:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:35,584 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 285 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2020-12-23 11:38:35,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421195646] [2020-12-23 11:38:35,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906075024] [2020-12-23 11:38:35,585 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:38:39,830 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 11:38:39,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 11:38:39,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-23 11:38:39,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 11:38:40,338 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2020-12-23 11:38:40,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 11:38:40,339 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2020-12-23 11:38:40,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646742281] [2020-12-23 11:38:40,340 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 11:38:40,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:38:40,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 11:38:40,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-12-23 11:38:40,341 INFO L87 Difference]: Start difference. First operand 704 states and 899 transitions. Second operand 7 states. [2020-12-23 11:38:40,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:38:40,611 INFO L93 Difference]: Finished difference Result 722 states and 916 transitions. [2020-12-23 11:38:40,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:38:40,612 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 158 [2020-12-23 11:38:40,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:38:40,616 INFO L225 Difference]: With dead ends: 722 [2020-12-23 11:38:40,616 INFO L226 Difference]: Without dead ends: 720 [2020-12-23 11:38:40,617 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2020-12-23 11:38:40,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2020-12-23 11:38:40,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 706. [2020-12-23 11:38:40,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2020-12-23 11:38:40,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 901 transitions. [2020-12-23 11:38:40,639 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 901 transitions. Word has length 158 [2020-12-23 11:38:40,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:38:40,640 INFO L481 AbstractCegarLoop]: Abstraction has 706 states and 901 transitions. [2020-12-23 11:38:40,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 11:38:40,640 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 901 transitions. [2020-12-23 11:38:40,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2020-12-23 11:38:40,643 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:38:40,643 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,856 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:38:40,857 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:38:40,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:38:40,857 INFO L82 PathProgramCache]: Analyzing trace with hash 410545662, now seen corresponding path program 1 times [2020-12-23 11:38:40,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:38:40,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662872379] [2020-12-23 11:38:40,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:38:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:41,110 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 285 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2020-12-23 11:38:41,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662872379] [2020-12-23 11:38:41,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325460472] [2020-12-23 11:38:41,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:38:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:41,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 1010 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-23 11:38:41,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 11:38:41,679 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 285 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2020-12-23 11:38:41,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 11:38:41,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-12-23 11:38:41,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546879821] [2020-12-23 11:38:41,680 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 11:38:41,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:38:41,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 11:38:41,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-12-23 11:38:41,681 INFO L87 Difference]: Start difference. First operand 706 states and 901 transitions. Second operand 9 states. [2020-12-23 11:38:41,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:38:41,822 INFO L93 Difference]: Finished difference Result 1369 states and 1755 transitions. [2020-12-23 11:38:41,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 11:38:41,823 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 160 [2020-12-23 11:38:41,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:38:41,826 INFO L225 Difference]: With dead ends: 1369 [2020-12-23 11:38:41,826 INFO L226 Difference]: Without dead ends: 716 [2020-12-23 11:38:41,828 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-12-23 11:38:41,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2020-12-23 11:38:41,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2020-12-23 11:38:41,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2020-12-23 11:38:41,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 912 transitions. [2020-12-23 11:38:41,849 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 912 transitions. Word has length 160 [2020-12-23 11:38:41,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:38:41,850 INFO L481 AbstractCegarLoop]: Abstraction has 716 states and 912 transitions. [2020-12-23 11:38:41,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 11:38:41,850 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 912 transitions. [2020-12-23 11:38:41,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2020-12-23 11:38:41,853 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:38:41,853 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,066 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-12-23 11:38:42,067 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:38:42,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:38:42,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1843661312, now seen corresponding path program 2 times [2020-12-23 11:38:42,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:38:42,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888454807] [2020-12-23 11:38:42,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:38:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:48,202 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2020-12-23 11:38:48,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888454807] [2020-12-23 11:38:48,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:38:48,203 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:38:48,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094838816] [2020-12-23 11:38:48,203 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 11:38:48,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:38:48,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 11:38:48,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 11:38:48,204 INFO L87 Difference]: Start difference. First operand 716 states and 912 transitions. Second operand 4 states. [2020-12-23 11:38:48,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:38:48,338 INFO L93 Difference]: Finished difference Result 730 states and 925 transitions. [2020-12-23 11:38:48,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:38:48,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2020-12-23 11:38:48,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:38:48,342 INFO L225 Difference]: With dead ends: 730 [2020-12-23 11:38:48,343 INFO L226 Difference]: Without dead ends: 728 [2020-12-23 11:38:48,343 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:38:48,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2020-12-23 11:38:48,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 718. [2020-12-23 11:38:48,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2020-12-23 11:38:48,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 914 transitions. [2020-12-23 11:38:48,369 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 914 transitions. Word has length 170 [2020-12-23 11:38:48,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:38:48,369 INFO L481 AbstractCegarLoop]: Abstraction has 718 states and 914 transitions. [2020-12-23 11:38:48,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 11:38:48,370 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 914 transitions. [2020-12-23 11:38:48,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2020-12-23 11:38:48,372 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:38:48,373 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,373 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 11:38:48,373 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:38:48,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:38:48,374 INFO L82 PathProgramCache]: Analyzing trace with hash 2063178851, now seen corresponding path program 1 times [2020-12-23 11:38:48,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:38:48,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404004779] [2020-12-23 11:38:48,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:38:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:56,924 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2020-12-23 11:38:56,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404004779] [2020-12-23 11:38:56,925 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:38:56,925 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:38:56,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790707683] [2020-12-23 11:38:56,926 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 11:38:56,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:38:56,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 11:38:56,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 11:38:56,927 INFO L87 Difference]: Start difference. First operand 718 states and 914 transitions. Second operand 4 states. [2020-12-23 11:38:57,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:38:57,065 INFO L93 Difference]: Finished difference Result 728 states and 923 transitions. [2020-12-23 11:38:57,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:38:57,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2020-12-23 11:38:57,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:38:57,070 INFO L225 Difference]: With dead ends: 728 [2020-12-23 11:38:57,070 INFO L226 Difference]: Without dead ends: 726 [2020-12-23 11:38:57,070 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:38:57,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2020-12-23 11:38:57,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 720. [2020-12-23 11:38:57,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2020-12-23 11:38:57,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 916 transitions. [2020-12-23 11:38:57,095 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 916 transitions. Word has length 172 [2020-12-23 11:38:57,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:38:57,096 INFO L481 AbstractCegarLoop]: Abstraction has 720 states and 916 transitions. [2020-12-23 11:38:57,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 11:38:57,096 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 916 transitions. [2020-12-23 11:38:57,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-12-23 11:38:57,098 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:38:57,099 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57,099 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 11:38:57,099 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:38:57,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:38:57,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1559808154, now seen corresponding path program 1 times [2020-12-23 11:38:57,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:38:57,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227657373] [2020-12-23 11:38:57,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:38:57,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:57,363 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2020-12-23 11:38:57,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227657373] [2020-12-23 11:38:57,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:38:57,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:38:57,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171880506] [2020-12-23 11:38:57,365 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 11:38:57,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:38:57,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 11:38:57,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 11:38:57,369 INFO L87 Difference]: Start difference. First operand 720 states and 916 transitions. Second operand 4 states. [2020-12-23 11:38:57,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:38:57,484 INFO L93 Difference]: Finished difference Result 726 states and 921 transitions. [2020-12-23 11:38:57,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:38:57,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2020-12-23 11:38:57,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:38:57,489 INFO L225 Difference]: With dead ends: 726 [2020-12-23 11:38:57,489 INFO L226 Difference]: Without dead ends: 569 [2020-12-23 11:38:57,490 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:38:57,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-12-23 11:38:57,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 567. [2020-12-23 11:38:57,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2020-12-23 11:38:57,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 732 transitions. [2020-12-23 11:38:57,513 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 732 transitions. Word has length 174 [2020-12-23 11:38:57,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:38:57,513 INFO L481 AbstractCegarLoop]: Abstraction has 567 states and 732 transitions. [2020-12-23 11:38:57,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 11:38:57,513 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 732 transitions. [2020-12-23 11:38:57,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-12-23 11:38:57,516 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:38:57,516 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57,516 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 11:38:57,517 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:38:57,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:38:57,517 INFO L82 PathProgramCache]: Analyzing trace with hash -190890505, now seen corresponding path program 1 times [2020-12-23 11:38:57,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:38:57,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894847082] [2020-12-23 11:38:57,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:38:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:57,739 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2020-12-23 11:38:57,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894847082] [2020-12-23 11:38:57,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:38:57,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:38:57,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498505744] [2020-12-23 11:38:57,745 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:38:57,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:38:57,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:38:57,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:38:57,749 INFO L87 Difference]: Start difference. First operand 567 states and 732 transitions. Second operand 3 states. [2020-12-23 11:38:57,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:38:57,906 INFO L93 Difference]: Finished difference Result 1088 states and 1416 transitions. [2020-12-23 11:38:57,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:38:57,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2020-12-23 11:38:57,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:38:57,911 INFO L225 Difference]: With dead ends: 1088 [2020-12-23 11:38:57,911 INFO L226 Difference]: Without dead ends: 644 [2020-12-23 11:38:57,912 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:57,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2020-12-23 11:38:57,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2020-12-23 11:38:57,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2020-12-23 11:38:57,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 836 transitions. [2020-12-23 11:38:57,934 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 836 transitions. Word has length 184 [2020-12-23 11:38:57,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:38:57,935 INFO L481 AbstractCegarLoop]: Abstraction has 644 states and 836 transitions. [2020-12-23 11:38:57,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:38:57,935 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 836 transitions. [2020-12-23 11:38:57,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-12-23 11:38:57,938 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:38:57,938 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57,938 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 11:38:57,938 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:38:57,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:38:57,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1536254457, now seen corresponding path program 1 times [2020-12-23 11:38:57,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:38:57,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932171675] [2020-12-23 11:38:57,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:38:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:38:58,198 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2020-12-23 11:38:58,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932171675] [2020-12-23 11:38:58,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:38:58,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:38:58,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22981082] [2020-12-23 11:38:58,199 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 11:38:58,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:38:58,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 11:38:58,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 11:38:58,200 INFO L87 Difference]: Start difference. First operand 644 states and 836 transitions. Second operand 4 states. [2020-12-23 11:38:58,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:38:58,461 INFO L93 Difference]: Finished difference Result 1172 states and 1529 transitions. [2020-12-23 11:38:58,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 11:38:58,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2020-12-23 11:38:58,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:38:58,465 INFO L225 Difference]: With dead ends: 1172 [2020-12-23 11:38:58,466 INFO L226 Difference]: Without dead ends: 735 [2020-12-23 11:38:58,467 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:58,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2020-12-23 11:38:58,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735. [2020-12-23 11:38:58,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2020-12-23 11:38:58,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 957 transitions. [2020-12-23 11:38:58,492 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 957 transitions. Word has length 184 [2020-12-23 11:38:58,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:38:58,493 INFO L481 AbstractCegarLoop]: Abstraction has 735 states and 957 transitions. [2020-12-23 11:38:58,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 11:38:58,493 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 957 transitions. [2020-12-23 11:38:58,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-12-23 11:38:58,496 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:38:58,496 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 11:38:58,497 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:38:58,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:38:58,498 INFO L82 PathProgramCache]: Analyzing trace with hash 912972855, now seen corresponding path program 1 times [2020-12-23 11:38:58,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:38:58,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015278788] [2020-12-23 11:38:58,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:39:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:39:06,738 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2020-12-23 11:39:06,739 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015278788] [2020-12-23 11:39:06,739 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:39:06,739 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:39:06,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728597598] [2020-12-23 11:39:06,740 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 11:39:06,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:39:06,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 11:39:06,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:39:06,741 INFO L87 Difference]: Start difference. First operand 735 states and 957 transitions. Second operand 5 states. [2020-12-23 11:39:06,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:39:06,936 INFO L93 Difference]: Finished difference Result 737 states and 959 transitions. [2020-12-23 11:39:06,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:39:06,936 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 184 [2020-12-23 11:39:06,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:39:06,940 INFO L225 Difference]: With dead ends: 737 [2020-12-23 11:39:06,941 INFO L226 Difference]: Without dead ends: 735 [2020-12-23 11:39:06,941 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 11:39:06,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2020-12-23 11:39:06,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 733. [2020-12-23 11:39:06,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2020-12-23 11:39:06,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 955 transitions. [2020-12-23 11:39:06,972 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 955 transitions. Word has length 184 [2020-12-23 11:39:06,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:39:06,973 INFO L481 AbstractCegarLoop]: Abstraction has 733 states and 955 transitions. [2020-12-23 11:39:06,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 11:39:06,973 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 955 transitions. [2020-12-23 11:39:06,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2020-12-23 11:39:06,976 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:39:06,977 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 11:39:06,977 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:39:06,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:39:06,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1193790298, now seen corresponding path program 1 times [2020-12-23 11:39:06,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:39:06,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709096903] [2020-12-23 11:39:06,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:39:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:39:30,177 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2020-12-23 11:39:30,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709096903] [2020-12-23 11:39:30,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:39:30,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:39:30,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094528531] [2020-12-23 11:39:30,179 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 11:39:30,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:39:30,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 11:39:30,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:39:30,179 INFO L87 Difference]: Start difference. First operand 733 states and 955 transitions. Second operand 5 states. [2020-12-23 11:39:30,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:39:30,431 INFO L93 Difference]: Finished difference Result 735 states and 957 transitions. [2020-12-23 11:39:30,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:39:30,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 186 [2020-12-23 11:39:30,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:39:30,436 INFO L225 Difference]: With dead ends: 735 [2020-12-23 11:39:30,436 INFO L226 Difference]: Without dead ends: 733 [2020-12-23 11:39:30,437 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 11:39:30,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2020-12-23 11:39:30,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 731. [2020-12-23 11:39:30,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2020-12-23 11:39:30,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 953 transitions. [2020-12-23 11:39:30,467 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 953 transitions. Word has length 186 [2020-12-23 11:39:30,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:39:30,468 INFO L481 AbstractCegarLoop]: Abstraction has 731 states and 953 transitions. [2020-12-23 11:39:30,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 11:39:30,468 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 953 transitions. [2020-12-23 11:39:30,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2020-12-23 11:39:30,471 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:39:30,472 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,472 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 11:39:30,472 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:39:30,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:39:30,473 INFO L82 PathProgramCache]: Analyzing trace with hash 476413725, now seen corresponding path program 1 times [2020-12-23 11:39:30,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:39:30,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090058554] [2020-12-23 11:39:30,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:39:35,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:39:36,064 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2020-12-23 11:39:36,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090058554] [2020-12-23 11:39:36,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:39:36,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:39:36,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027908437] [2020-12-23 11:39:36,065 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 11:39:36,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:39:36,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 11:39:36,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:39:36,066 INFO L87 Difference]: Start difference. First operand 731 states and 953 transitions. Second operand 5 states. [2020-12-23 11:39:37,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:39:37,819 INFO L93 Difference]: Finished difference Result 1697 states and 2208 transitions. [2020-12-23 11:39:37,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:39:37,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 188 [2020-12-23 11:39:37,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:39:37,826 INFO L225 Difference]: With dead ends: 1697 [2020-12-23 11:39:37,826 INFO L226 Difference]: Without dead ends: 1035 [2020-12-23 11:39:37,828 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:39:37,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2020-12-23 11:39:37,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 873. [2020-12-23 11:39:37,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2020-12-23 11:39:37,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1088 transitions. [2020-12-23 11:39:37,870 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1088 transitions. Word has length 188 [2020-12-23 11:39:37,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:39:37,870 INFO L481 AbstractCegarLoop]: Abstraction has 873 states and 1088 transitions. [2020-12-23 11:39:37,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 11:39:37,871 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1088 transitions. [2020-12-23 11:39:37,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2020-12-23 11:39:37,875 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:39:37,875 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,876 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 11:39:37,876 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:39:37,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:39:37,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1683649313, now seen corresponding path program 1 times [2020-12-23 11:39:37,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:39:37,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237096843] [2020-12-23 11:39:37,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:39:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:39:49,695 WARN L197 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2020-12-23 11:39:49,980 WARN L197 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2020-12-23 11:39:50,270 WARN L197 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2020-12-23 11:39:50,652 WARN L197 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-12-23 11:39:51,122 WARN L197 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 77 [2020-12-23 11:39:51,498 WARN L197 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 43 [2020-12-23 11:39:51,988 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2020-12-23 11:39:51,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237096843] [2020-12-23 11:39:51,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:39:51,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 11:39:51,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667613501] [2020-12-23 11:39:51,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 11:39:51,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:39:51,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 11:39:51,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-12-23 11:39:51,991 INFO L87 Difference]: Start difference. First operand 873 states and 1088 transitions. Second operand 11 states. [2020-12-23 11:39:54,647 WARN L197 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2020-12-23 11:39:55,276 WARN L197 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2020-12-23 11:39:56,183 WARN L197 SmtUtils]: Spent 769.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 82 [2020-12-23 11:39:56,941 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2020-12-23 11:40:02,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:40:02,012 INFO L93 Difference]: Finished difference Result 1637 states and 2000 transitions. [2020-12-23 11:40:02,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-23 11:40:02,015 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 188 [2020-12-23 11:40:02,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:40:02,021 INFO L225 Difference]: With dead ends: 1637 [2020-12-23 11:40:02,022 INFO L226 Difference]: Without dead ends: 1378 [2020-12-23 11:40:02,023 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-12-23 11:40:02,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2020-12-23 11:40:02,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 873. [2020-12-23 11:40:02,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2020-12-23 11:40:02,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1085 transitions. [2020-12-23 11:40:02,073 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1085 transitions. Word has length 188 [2020-12-23 11:40:02,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:40:02,073 INFO L481 AbstractCegarLoop]: Abstraction has 873 states and 1085 transitions. [2020-12-23 11:40:02,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 11:40:02,074 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1085 transitions. [2020-12-23 11:40:02,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2020-12-23 11:40:02,077 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:40:02,078 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,078 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 11:40:02,078 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:40:02,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:40:02,079 INFO L82 PathProgramCache]: Analyzing trace with hash 371596022, now seen corresponding path program 1 times [2020-12-23 11:40:02,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:40:02,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071295794] [2020-12-23 11:40:02,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:40:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:40:02,424 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2020-12-23 11:40:02,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071295794] [2020-12-23 11:40:02,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:40:02,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:40:02,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417069806] [2020-12-23 11:40:02,425 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 11:40:02,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:40:02,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 11:40:02,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 11:40:02,426 INFO L87 Difference]: Start difference. First operand 873 states and 1085 transitions. Second operand 4 states. [2020-12-23 11:40:04,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:40:04,764 INFO L93 Difference]: Finished difference Result 1191 states and 1455 transitions. [2020-12-23 11:40:04,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 11:40:04,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2020-12-23 11:40:04,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:40:04,769 INFO L225 Difference]: With dead ends: 1191 [2020-12-23 11:40:04,769 INFO L226 Difference]: Without dead ends: 824 [2020-12-23 11:40:04,770 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:40:04,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2020-12-23 11:40:04,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 822. [2020-12-23 11:40:04,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2020-12-23 11:40:04,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1018 transitions. [2020-12-23 11:40:04,810 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1018 transitions. Word has length 198 [2020-12-23 11:40:04,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:40:04,811 INFO L481 AbstractCegarLoop]: Abstraction has 822 states and 1018 transitions. [2020-12-23 11:40:04,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 11:40:04,811 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1018 transitions. [2020-12-23 11:40:04,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2020-12-23 11:40:04,814 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:40:04,815 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,815 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 11:40:04,815 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:40:04,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:40:04,816 INFO L82 PathProgramCache]: Analyzing trace with hash -2060707338, now seen corresponding path program 1 times [2020-12-23 11:40:04,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:40:04,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539373732] [2020-12-23 11:40:04,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:40:04,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:40:05,150 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2020-12-23 11:40:05,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539373732] [2020-12-23 11:40:05,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:40:05,151 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:40:05,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545670677] [2020-12-23 11:40:05,151 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 11:40:05,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:40:05,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 11:40:05,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 11:40:05,153 INFO L87 Difference]: Start difference. First operand 822 states and 1018 transitions. Second operand 4 states. [2020-12-23 11:40:07,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:40:07,372 INFO L93 Difference]: Finished difference Result 944 states and 1141 transitions. [2020-12-23 11:40:07,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 11:40:07,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2020-12-23 11:40:07,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:40:07,376 INFO L225 Difference]: With dead ends: 944 [2020-12-23 11:40:07,376 INFO L226 Difference]: Without dead ends: 693 [2020-12-23 11:40:07,377 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:40:07,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2020-12-23 11:40:07,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 693. [2020-12-23 11:40:07,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2020-12-23 11:40:07,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 852 transitions. [2020-12-23 11:40:07,409 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 852 transitions. Word has length 198 [2020-12-23 11:40:07,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:40:07,409 INFO L481 AbstractCegarLoop]: Abstraction has 693 states and 852 transitions. [2020-12-23 11:40:07,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 11:40:07,410 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 852 transitions. [2020-12-23 11:40:07,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2020-12-23 11:40:07,412 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:40:07,412 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:40:07,412 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 11:40:07,412 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:40:07,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:40:07,413 INFO L82 PathProgramCache]: Analyzing trace with hash 283322422, now seen corresponding path program 1 times [2020-12-23 11:40:07,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:40:07,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576404538] [2020-12-23 11:40:07,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:40:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:40:09,556 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 15 [2020-12-23 11:40:09,700 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2020-12-23 11:40:09,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576404538] [2020-12-23 11:40:09,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:40:09,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 11:40:09,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753175182] [2020-12-23 11:40:09,701 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 11:40:09,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:40:09,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 11:40:09,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-12-23 11:40:09,702 INFO L87 Difference]: Start difference. First operand 693 states and 852 transitions. Second operand 8 states. [2020-12-23 11:40:12,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:40:12,272 INFO L93 Difference]: Finished difference Result 1231 states and 1446 transitions. [2020-12-23 11:40:12,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 11:40:12,273 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 198 [2020-12-23 11:40:12,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:40:12,277 INFO L225 Difference]: With dead ends: 1231 [2020-12-23 11:40:12,277 INFO L226 Difference]: Without dead ends: 867 [2020-12-23 11:40:12,279 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-12-23 11:40:12,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2020-12-23 11:40:12,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 597. [2020-12-23 11:40:12,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2020-12-23 11:40:12,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 723 transitions. [2020-12-23 11:40:12,318 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 723 transitions. Word has length 198 [2020-12-23 11:40:12,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:40:12,318 INFO L481 AbstractCegarLoop]: Abstraction has 597 states and 723 transitions. [2020-12-23 11:40:12,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 11:40:12,318 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 723 transitions. [2020-12-23 11:40:12,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2020-12-23 11:40:12,320 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:40:12,321 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 11:40:12,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 11:40:12,321 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:40:12,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:40:12,322 INFO L82 PathProgramCache]: Analyzing trace with hash 540545019, now seen corresponding path program 1 times [2020-12-23 11:40:12,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:40:12,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811450742] [2020-12-23 11:40:12,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:40:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:40:14,903 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2020-12-23 11:40:14,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811450742] [2020-12-23 11:40:14,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:40:14,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 11:40:14,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057413346] [2020-12-23 11:40:14,904 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 11:40:14,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:40:14,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 11:40:14,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-12-23 11:40:14,906 INFO L87 Difference]: Start difference. First operand 597 states and 723 transitions. Second operand 8 states. [2020-12-23 11:40:17,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:40:17,335 INFO L93 Difference]: Finished difference Result 1135 states and 1317 transitions. [2020-12-23 11:40:17,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 11:40:17,336 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 199 [2020-12-23 11:40:17,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:40:17,340 INFO L225 Difference]: With dead ends: 1135 [2020-12-23 11:40:17,340 INFO L226 Difference]: Without dead ends: 768 [2020-12-23 11:40:17,341 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-12-23 11:40:17,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2020-12-23 11:40:17,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 498. [2020-12-23 11:40:17,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2020-12-23 11:40:17,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 591 transitions. [2020-12-23 11:40:17,374 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 591 transitions. Word has length 199 [2020-12-23 11:40:17,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:40:17,375 INFO L481 AbstractCegarLoop]: Abstraction has 498 states and 591 transitions. [2020-12-23 11:40:17,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 11:40:17,375 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 591 transitions. [2020-12-23 11:40:17,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2020-12-23 11:40:17,377 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:40:17,377 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,377 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 11:40:17,378 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:40:17,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:40:17,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1717518972, now seen corresponding path program 1 times [2020-12-23 11:40:17,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:40:17,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587177693] [2020-12-23 11:40:17,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:40:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:40:25,108 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 20 [2020-12-23 11:40:25,291 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 19 [2020-12-23 11:40:25,389 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2020-12-23 11:40:25,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587177693] [2020-12-23 11:40:25,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:40:25,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 11:40:25,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641984433] [2020-12-23 11:40:25,390 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 11:40:25,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:40:25,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 11:40:25,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-23 11:40:25,391 INFO L87 Difference]: Start difference. First operand 498 states and 591 transitions. Second operand 6 states. [2020-12-23 11:40:26,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:40:26,858 INFO L93 Difference]: Finished difference Result 1215 states and 1415 transitions. [2020-12-23 11:40:26,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 11:40:26,858 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 199 [2020-12-23 11:40:26,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:40:26,861 INFO L225 Difference]: With dead ends: 1215 [2020-12-23 11:40:26,861 INFO L226 Difference]: Without dead ends: 847 [2020-12-23 11:40:26,863 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-12-23 11:40:26,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2020-12-23 11:40:26,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 569. [2020-12-23 11:40:26,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2020-12-23 11:40:26,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 677 transitions. [2020-12-23 11:40:26,905 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 677 transitions. Word has length 199 [2020-12-23 11:40:26,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:40:26,905 INFO L481 AbstractCegarLoop]: Abstraction has 569 states and 677 transitions. [2020-12-23 11:40:26,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 11:40:26,906 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 677 transitions. [2020-12-23 11:40:26,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2020-12-23 11:40:26,907 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:40:26,908 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-23 11:40:26,908 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:40:26,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:40:26,909 INFO L82 PathProgramCache]: Analyzing trace with hash 159544258, now seen corresponding path program 1 times [2020-12-23 11:40:26,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:40:26,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168833178] [2020-12-23 11:40:26,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:40:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:40:34,668 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2020-12-23 11:40:34,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168833178] [2020-12-23 11:40:34,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:40:34,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 11:40:34,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769554614] [2020-12-23 11:40:34,669 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 11:40:34,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:40:34,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 11:40:34,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-12-23 11:40:34,670 INFO L87 Difference]: Start difference. First operand 569 states and 677 transitions. Second operand 10 states. [2020-12-23 11:40:38,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:40:38,139 INFO L93 Difference]: Finished difference Result 932 states and 1080 transitions. [2020-12-23 11:40:38,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 11:40:38,140 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 199 [2020-12-23 11:40:38,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:40:38,143 INFO L225 Difference]: With dead ends: 932 [2020-12-23 11:40:38,143 INFO L226 Difference]: Without dead ends: 828 [2020-12-23 11:40:38,143 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-12-23 11:40:38,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2020-12-23 11:40:38,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 602. [2020-12-23 11:40:38,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2020-12-23 11:40:38,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 718 transitions. [2020-12-23 11:40:38,190 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 718 transitions. Word has length 199 [2020-12-23 11:40:38,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:40:38,190 INFO L481 AbstractCegarLoop]: Abstraction has 602 states and 718 transitions. [2020-12-23 11:40:38,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 11:40:38,190 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 718 transitions. [2020-12-23 11:40:38,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2020-12-23 11:40:38,192 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:40:38,192 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,192 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 11:40:38,193 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:40:38,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:40:38,193 INFO L82 PathProgramCache]: Analyzing trace with hash -924945767, now seen corresponding path program 1 times [2020-12-23 11:40:38,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:40:38,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706183465] [2020-12-23 11:40:38,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:40:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:40:41,132 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2020-12-23 11:40:41,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706183465] [2020-12-23 11:40:41,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:40:41,133 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 11:40:41,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437023029] [2020-12-23 11:40:41,134 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 11:40:41,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:40:41,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 11:40:41,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-23 11:40:41,135 INFO L87 Difference]: Start difference. First operand 602 states and 718 transitions. Second operand 7 states. [2020-12-23 11:40:43,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:40:43,576 INFO L93 Difference]: Finished difference Result 963 states and 1082 transitions. [2020-12-23 11:40:43,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 11:40:43,577 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 209 [2020-12-23 11:40:43,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:40:43,579 INFO L225 Difference]: With dead ends: 963 [2020-12-23 11:40:43,579 INFO L226 Difference]: Without dead ends: 706 [2020-12-23 11:40:43,580 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-12-23 11:40:43,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2020-12-23 11:40:43,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 477. [2020-12-23 11:40:43,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2020-12-23 11:40:43,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 555 transitions. [2020-12-23 11:40:43,622 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 555 transitions. Word has length 209 [2020-12-23 11:40:43,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:40:43,622 INFO L481 AbstractCegarLoop]: Abstraction has 477 states and 555 transitions. [2020-12-23 11:40:43,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 11:40:43,623 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 555 transitions. [2020-12-23 11:40:43,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2020-12-23 11:40:43,624 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:40:43,624 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-23 11:40:43,625 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:40:43,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:40:43,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1794765588, now seen corresponding path program 1 times [2020-12-23 11:40:43,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:40:43,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774070091] [2020-12-23 11:40:43,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:40:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:40:50,362 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2020-12-23 11:40:50,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774070091] [2020-12-23 11:40:50,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:40:50,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 11:40:50,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508592569] [2020-12-23 11:40:50,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 11:40:50,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:40:50,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 11:40:50,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:40:50,364 INFO L87 Difference]: Start difference. First operand 477 states and 555 transitions. Second operand 5 states. [2020-12-23 11:40:51,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:40:51,080 INFO L93 Difference]: Finished difference Result 865 states and 981 transitions. [2020-12-23 11:40:51,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 11:40:51,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2020-12-23 11:40:51,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:40:51,083 INFO L225 Difference]: With dead ends: 865 [2020-12-23 11:40:51,083 INFO L226 Difference]: Without dead ends: 550 [2020-12-23 11:40:51,083 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-23 11:40:51,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-12-23 11:40:51,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 435. [2020-12-23 11:40:51,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2020-12-23 11:40:51,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 476 transitions. [2020-12-23 11:40:51,113 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 476 transitions. Word has length 210 [2020-12-23 11:40:51,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:40:51,113 INFO L481 AbstractCegarLoop]: Abstraction has 435 states and 476 transitions. [2020-12-23 11:40:51,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 11:40:51,113 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 476 transitions. [2020-12-23 11:40:51,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2020-12-23 11:40:51,115 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:40:51,115 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-23 11:40:51,116 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:40:51,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:40:51,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1875920492, now seen corresponding path program 1 times [2020-12-23 11:40:51,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:40:51,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056248356] [2020-12-23 11:40:51,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY