/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_lazy.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 21:31:22,057 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 21:31:22,060 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 21:31:22,109 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 21:31:22,110 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 21:31:22,116 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 21:31:22,120 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 21:31:22,127 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 21:31:22,131 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 21:31:22,137 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 21:31:22,142 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 21:31:22,144 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 21:31:22,144 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 21:31:22,148 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 21:31:22,150 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 21:31:22,153 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 21:31:22,154 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 21:31:22,159 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 21:31:22,167 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 21:31:22,177 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 21:31:22,180 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 21:31:22,183 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 21:31:22,185 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 21:31:22,188 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 21:31:22,198 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 21:31:22,199 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 21:31:22,199 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 21:31:22,202 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 21:31:22,202 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 21:31:22,204 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 21:31:22,204 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 21:31:22,205 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 21:31:22,207 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 21:31:22,208 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 21:31:22,243 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 21:31:22,243 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 21:31:22,244 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 21:31:22,244 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 21:31:22,245 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 21:31:22,246 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 21:31:22,247 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 21:31:22,249 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 21:31:22,304 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 21:31:22,304 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 21:31:22,310 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 21:31:22,310 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 21:31:22,311 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 21:31:22,311 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 21:31:22,311 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 21:31:22,312 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 21:31:22,312 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 21:31:22,312 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 21:31:22,314 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 21:31:22,314 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 21:31:22,314 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 21:31:22,315 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 21:31:22,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 21:31:22,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 21:31:22,316 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 21:31:22,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 21:31:22,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 21:31:22,317 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 21:31:22,317 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 21:31:22,317 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 21:31:22,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 21:31:22,318 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 21:31:22,318 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 21:31:22,318 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 21:31:22,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 21:31:22,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 21:31:22,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 21:31:22,841 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 21:31:22,842 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 21:31:22,843 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_lazy.i [2021-01-06 21:31:22,935 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/2c69715c7/64115ededc694f01906497b49872e288/FLAG7b61680e3 [2021-01-06 21:31:23,687 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 21:31:23,687 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i [2021-01-06 21:31:23,716 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/2c69715c7/64115ededc694f01906497b49872e288/FLAG7b61680e3 [2021-01-06 21:31:23,921 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/2c69715c7/64115ededc694f01906497b49872e288 [2021-01-06 21:31:23,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 21:31:23,929 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 21:31:23,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 21:31:23,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 21:31:23,938 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 21:31:23,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 09:31:23" (1/1) ... [2021-01-06 21:31:23,942 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47d327e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:31:23, skipping insertion in model container [2021-01-06 21:31:23,943 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 09:31:23" (1/1) ... [2021-01-06 21:31:23,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 21:31:24,032 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 21:31:24,579 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_lazy.i[23394,23407] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: lhs: VariableLHS[~j~0,] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_lockedon~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],[IdentifierExpression[~j~0,]]] left hand side expression in assignment: lhs: VariableLHS[~j~1,] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_lockedon~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],[IdentifierExpression[~j~1,]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_lockedon~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~id1,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_thread_allocated~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_thread_born_round~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_thread~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: address: IdentifierExpression[~id1,] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_cp___CS_thread_status~0,],[IdentifierExpression[~i~0,]]],[IdentifierExpression[~j~2,]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_cp___CS_thread_lockedon~0,],[IdentifierExpression[~i~0,]]],[IdentifierExpression[~j~2,]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_cp_mutex~0,],[IdentifierExpression[~i~0,]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_cp_data~0,],[IdentifierExpression[~i~0,]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[IntegerLiteral[1]]],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[IntegerLiteral[1]]],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[IntegerLiteral[1]]],[IntegerLiteral[2]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[IntegerLiteral[1]]],[IntegerLiteral[3]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_lockedon~0,GLOBAL],[IntegerLiteral[1]]],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_lockedon~0,GLOBAL],[IntegerLiteral[1]]],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_lockedon~0,GLOBAL],[IntegerLiteral[1]]],[IntegerLiteral[2]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_lockedon~0,GLOBAL],[IntegerLiteral[1]]],[IntegerLiteral[3]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~mutex~0,GLOBAL],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~data~0,GLOBAL],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_round~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_thread_index~0,GLOBAL] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_thread_born_round~0,GLOBAL],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[IntegerLiteral[0]]],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_thread~0,GLOBAL],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_thread_allocated~0,GLOBAL],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_round~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_round~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_round~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],[IntegerLiteral[2]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_round~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],[IntegerLiteral[3]]] [2021-01-06 21:31:24,789 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 21:31:24,805 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 21:31:24,842 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_lazy.i[23394,23407] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: lhs: VariableLHS[~j~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[32],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[32],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~j~1,]]]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[32],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],BinaryExpression[ARITHMUL,IntegerLiteral[8],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~id1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_allocated~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_thread_allocated~0,GLOBAL],offset],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_born_round~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_thread_born_round~0,GLOBAL],offset],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_thread~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],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[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_cp___CS_thread_status~0,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_cp___CS_thread_status~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~0,]]],IdentifierExpression[~j~2,]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_cp___CS_thread_lockedon~0,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_cp___CS_thread_lockedon~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[32],IdentifierExpression[~i~0,]]],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~j~2,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_cp_mutex~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_cp_mutex~0,],offset],IdentifierExpression[~i~0,]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_cp_data~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_cp_data~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~0,]]]]] 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[5],StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[6],StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[7],StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_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[40],StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#mutex~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~#mutex~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#data~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#data~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_round~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_thread_index~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_born_round~0,GLOBAL],base],StructAccessExpression[IdentifierExpression[~#__CS_thread_born_round~0,GLOBAL],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],base],StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],offset]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_thread~0,GLOBAL],[IntegerLiteral[0]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_allocated~0,GLOBAL],base],StructAccessExpression[IdentifierExpression[~#__CS_thread_allocated~0,GLOBAL],offset]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_round~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],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[4],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[4],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]]]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_round~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]]]]] [2021-01-06 21:31:24,948 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 21:31:25,037 INFO L208 MainTranslator]: Completed translation [2021-01-06 21:31:25,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:31:25 WrapperNode [2021-01-06 21:31:25,038 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 21:31:25,040 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 21:31:25,040 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 21:31:25,040 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 21:31:25,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:31:25" (1/1) ... [2021-01-06 21:31:25,080 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:31:25" (1/1) ... [2021-01-06 21:31:25,319 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 21:31:25,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 21:31:25,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 21:31:25,320 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 21:31:25,331 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:31:25" (1/1) ... [2021-01-06 21:31:25,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:31:25" (1/1) ... [2021-01-06 21:31:25,357 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:31:25" (1/1) ... [2021-01-06 21:31:25,357 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:31:25" (1/1) ... [2021-01-06 21:31:25,446 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:31:25" (1/1) ... [2021-01-06 21:31:25,471 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:31:25" (1/1) ... [2021-01-06 21:31:25,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:31:25" (1/1) ... [2021-01-06 21:31:25,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 21:31:25,510 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 21:31:25,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 21:31:25,510 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 21:31:25,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:31:25" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 21:31:25,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 21:31:25,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 21:31:25,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-06 21:31:25,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 21:31:25,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-06 21:31:25,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-06 21:31:25,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-01-06 21:31:25,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 21:31:25,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 21:31:25,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 21:31:26,007 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 21:31:26,008 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 21:31:26,023 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 21:31:26,024 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 21:31:26,036 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 21:31:26,037 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 21:31:26,051 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 21:31:26,052 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 21:31:31,394 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##686: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;assume -2147483648 <= __CS_cs_#t~nondet6 && __CS_cs_#t~nondet6 <= 2147483647; [2021-01-06 21:31:31,394 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##685: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-01-06 21:31:31,394 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##693: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;assume -2147483648 <= __CS_cs_#t~nondet6 && __CS_cs_#t~nondet6 <= 2147483647; [2021-01-06 21:31:31,395 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##692: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-01-06 21:31:31,395 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-11: assume 0 != ~__CS_ret~0 % 256;thread3_#res.base, thread3_#res.offset := 0, 0; [2021-01-06 21:31:31,395 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-11: assume !(0 != ~__CS_ret~0 % 256); [2021-01-06 21:31:31,395 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-12: assume 0 != ~__CS_ret~0 % 256;thread3_#res.base, thread3_#res.offset := 0, 0; [2021-01-06 21:31:31,396 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-12: 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; [2021-01-06 21:31:31,396 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-13: assume 0 != ~__CS_ret~0 % 256;thread3_#res.base, thread3_#res.offset := 0, 0; [2021-01-06 21:31:31,396 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-13: assume !(0 != ~__CS_ret~0 % 256); [2021-01-06 21:31:31,396 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-35: assume 0 != ~__CS_ret~0 % 256;thread3_#res.base, thread3_#res.offset := 0, 0; [2021-01-06 21:31:31,396 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-35: assume !(0 != ~__CS_ret~0 % 256); [2021-01-06 21:31:31,397 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-36: assume 0 != ~__CS_ret~0 % 256;thread3_#res.base, thread3_#res.offset := 0, 0; [2021-01-06 21:31:31,398 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-36: 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; [2021-01-06 21:31:31,398 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-37: assume 0 != ~__CS_ret~0 % 256;thread3_#res.base, thread3_#res.offset := 0, 0; [2021-01-06 21:31:31,398 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-37: assume !(0 != ~__CS_ret~0 % 256); [2021-01-06 21:31:31,399 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-59: assume 0 != ~__CS_ret~0 % 256;thread3_#res.base, thread3_#res.offset := 0, 0; [2021-01-06 21:31:31,399 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-59: assume !(0 != ~__CS_ret~0 % 256); [2021-01-06 21:31:31,399 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-60: assume 0 != ~__CS_ret~0 % 256;thread3_#res.base, thread3_#res.offset := 0, 0; [2021-01-06 21:31:31,399 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-60: 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; [2021-01-06 21:31:31,399 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-61: assume 0 != ~__CS_ret~0 % 256;thread3_#res.base, thread3_#res.offset := 0, 0; [2021-01-06 21:31:31,400 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-61: assume !(0 != ~__CS_ret~0 % 256); [2021-01-06 21:31:31,400 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-83: assume 0 != ~__CS_ret~0 % 256;thread3_#res.base, thread3_#res.offset := 0, 0; [2021-01-06 21:31:31,400 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-83: assume !(0 != ~__CS_ret~0 % 256); [2021-01-06 21:31:31,400 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-84: assume 0 != ~__CS_ret~0 % 256;thread3_#res.base, thread3_#res.offset := 0, 0; [2021-01-06 21:31:31,400 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-84: 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; [2021-01-06 21:31:31,400 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-85: assume 0 != ~__CS_ret~0 % 256;thread3_#res.base, thread3_#res.offset := 0, 0; [2021-01-06 21:31:31,401 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-85: assume !(0 != ~__CS_ret~0 % 256); [2021-01-06 21:31:31,401 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-33: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-01-06 21:31:31,401 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-33: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2); [2021-01-06 21:31:31,408 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-35: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;assume -2147483648 <= __CS_cs_#t~nondet6 && __CS_cs_#t~nondet6 <= 2147483647; [2021-01-06 21:31:31,408 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-33: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-01-06 21:31:31,408 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-33: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-01-06 21:31:31,409 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-35: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2021-01-06 21:31:31,410 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-36: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-01-06 21:31:31,410 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-36: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-01-06 21:31:31,410 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-99: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-01-06 21:31:31,410 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-99: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2); [2021-01-06 21:31:31,411 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-38: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2021-01-06 21:31:31,411 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-39: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-01-06 21:31:31,411 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-39: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-01-06 21:31:31,411 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-101: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;assume -2147483648 <= __CS_cs_#t~nondet6 && __CS_cs_#t~nondet6 <= 2147483647; [2021-01-06 21:31:31,412 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-41: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2021-01-06 21:31:31,412 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##421: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;assume -2147483648 <= __CS_cs_#t~nondet6 && __CS_cs_#t~nondet6 <= 2147483647; [2021-01-06 21:31:31,412 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##420: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-01-06 21:31:31,413 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##427: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-01-06 21:31:31,413 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##428: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;assume -2147483648 <= __CS_cs_#t~nondet6 && __CS_cs_#t~nondet6 <= 2147483647; [2021-01-06 21:31:31,413 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-165: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-01-06 21:31:31,413 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-165: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2); [2021-01-06 21:31:31,413 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-105: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-01-06 21:31:31,413 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-105: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-01-06 21:31:31,414 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-167: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;assume -2147483648 <= __CS_cs_#t~nondet6 && __CS_cs_#t~nondet6 <= 2147483647; [2021-01-06 21:31:31,415 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-107: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2021-01-06 21:31:31,415 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-108: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-01-06 21:31:31,415 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-108: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-01-06 21:31:31,415 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-110: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2021-01-06 21:31:31,416 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-111: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-01-06 21:31:31,417 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-111: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-01-06 21:31:31,417 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-113: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2021-01-06 21:31:31,417 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-231: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-01-06 21:31:31,419 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-231: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2); [2021-01-06 21:31:31,419 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-233: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;assume -2147483648 <= __CS_cs_#t~nondet6 && __CS_cs_#t~nondet6 <= 2147483647; [2021-01-06 21:31:31,420 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-177: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-01-06 21:31:31,420 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-177: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-01-06 21:31:31,420 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-179: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2021-01-06 21:31:31,420 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-180: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-01-06 21:31:31,420 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-180: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-01-06 21:31:31,420 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-182: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2021-01-06 21:31:31,421 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-183: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-01-06 21:31:31,421 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-183: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-01-06 21:31:31,421 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-185: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2021-01-06 21:31:31,422 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-249: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-01-06 21:31:31,422 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-249: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-01-06 21:31:31,422 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-251: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2021-01-06 21:31:31,422 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-252: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-01-06 21:31:31,423 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-252: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-01-06 21:31:31,423 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-254: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2021-01-06 21:31:31,423 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-255: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-01-06 21:31:31,423 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-255: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-01-06 21:31:31,423 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-257: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2021-01-06 21:31:31,424 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##951: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;assume -2147483648 <= __CS_cs_#t~nondet6 && __CS_cs_#t~nondet6 <= 2147483647; [2021-01-06 21:31:31,424 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##950: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-01-06 21:31:31,424 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##958: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;assume -2147483648 <= __CS_cs_#t~nondet6 && __CS_cs_#t~nondet6 <= 2147483647; [2021-01-06 21:31:31,424 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##957: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-01-06 21:31:31,424 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##155: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-01-06 21:31:31,425 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##156: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;assume -2147483648 <= __CS_cs_#t~nondet6 && __CS_cs_#t~nondet6 <= 2147483647; [2021-01-06 21:31:31,425 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##162: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-01-06 21:31:31,425 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##163: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;assume -2147483648 <= __CS_cs_#t~nondet6 && __CS_cs_#t~nondet6 <= 2147483647; [2021-01-06 21:31:31,455 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 21:31:31,455 INFO L299 CfgBuilder]: Removed 344 assume(true) statements. [2021-01-06 21:31:31,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 09:31:31 BoogieIcfgContainer [2021-01-06 21:31:31,460 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 21:31:31,464 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 21:31:31,465 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 21:31:31,469 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 21:31:31,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 09:31:23" (1/3) ... [2021-01-06 21:31:31,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e7fba2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 09:31:31, skipping insertion in model container [2021-01-06 21:31:31,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:31:25" (2/3) ... [2021-01-06 21:31:31,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e7fba2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 09:31:31, skipping insertion in model container [2021-01-06 21:31:31,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 09:31:31" (3/3) ... [2021-01-06 21:31:31,475 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_lazy.i [2021-01-06 21:31:31,487 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 21:31:31,494 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 21:31:31,517 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 21:31:31,553 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 21:31:31,553 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 21:31:31,553 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 21:31:31,553 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 21:31:31,554 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 21:31:31,554 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 21:31:31,554 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 21:31:31,554 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 21:31:31,601 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states. [2021-01-06 21:31:31,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-01-06 21:31:31,620 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:31:31,621 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] [2021-01-06 21:31:31,621 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:31:31,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:31:31,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1957547703, now seen corresponding path program 1 times [2021-01-06 21:31:31,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:31:31,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501884634] [2021-01-06 21:31:31,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:31:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:31:32,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:31:32,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501884634] [2021-01-06 21:31:32,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:31:32,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:31:32,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770194552] [2021-01-06 21:31:32,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:31:32,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:31:32,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:31:32,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:31:32,043 INFO L87 Difference]: Start difference. First operand 687 states. Second operand 3 states. [2021-01-06 21:31:32,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:31:32,182 INFO L93 Difference]: Finished difference Result 1377 states and 2153 transitions. [2021-01-06 21:31:32,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:31:32,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2021-01-06 21:31:32,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:31:32,228 INFO L225 Difference]: With dead ends: 1377 [2021-01-06 21:31:32,229 INFO L226 Difference]: Without dead ends: 688 [2021-01-06 21:31:32,239 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:31:32,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2021-01-06 21:31:32,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 684. [2021-01-06 21:31:32,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2021-01-06 21:31:32,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 961 transitions. [2021-01-06 21:31:32,356 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 961 transitions. Word has length 34 [2021-01-06 21:31:32,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:31:32,356 INFO L481 AbstractCegarLoop]: Abstraction has 684 states and 961 transitions. [2021-01-06 21:31:32,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:31:32,356 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 961 transitions. [2021-01-06 21:31:32,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-01-06 21:31:32,368 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:31:32,369 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] [2021-01-06 21:31:32,369 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 21:31:32,369 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:31:32,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:31:32,372 INFO L82 PathProgramCache]: Analyzing trace with hash -2007769921, now seen corresponding path program 1 times [2021-01-06 21:31:32,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:31:32,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022522489] [2021-01-06 21:31:32,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:31:32,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:31:32,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:31:32,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022522489] [2021-01-06 21:31:32,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:31:32,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:31:32,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711218634] [2021-01-06 21:31:32,529 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:31:32,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:31:32,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:31:32,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:31:32,531 INFO L87 Difference]: Start difference. First operand 684 states and 961 transitions. Second operand 3 states. [2021-01-06 21:31:32,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:31:32,588 INFO L93 Difference]: Finished difference Result 1367 states and 1922 transitions. [2021-01-06 21:31:32,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:31:32,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2021-01-06 21:31:32,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:31:32,596 INFO L225 Difference]: With dead ends: 1367 [2021-01-06 21:31:32,596 INFO L226 Difference]: Without dead ends: 686 [2021-01-06 21:31:32,600 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:31:32,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2021-01-06 21:31:32,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 685. [2021-01-06 21:31:32,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2021-01-06 21:31:32,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 962 transitions. [2021-01-06 21:31:32,635 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 962 transitions. Word has length 38 [2021-01-06 21:31:32,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:31:32,638 INFO L481 AbstractCegarLoop]: Abstraction has 685 states and 962 transitions. [2021-01-06 21:31:32,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:31:32,638 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 962 transitions. [2021-01-06 21:31:32,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-06 21:31:32,642 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:31:32,642 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] [2021-01-06 21:31:32,642 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 21:31:32,642 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:31:32,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:31:32,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1881442557, now seen corresponding path program 1 times [2021-01-06 21:31:32,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:31:32,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755022670] [2021-01-06 21:31:32,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:31:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:31:32,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:31:32,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755022670] [2021-01-06 21:31:32,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652254183] [2021-01-06 21:31:32,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 21:31:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:31:33,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 21:31:33,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 21:31:33,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:31:33,280 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 21:31:33,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-01-06 21:31:33,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924571170] [2021-01-06 21:31:33,282 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:31:33,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:31:33,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:31:33,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:31:33,284 INFO L87 Difference]: Start difference. First operand 685 states and 962 transitions. Second operand 5 states. [2021-01-06 21:31:33,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:31:33,406 INFO L93 Difference]: Finished difference Result 1370 states and 1925 transitions. [2021-01-06 21:31:33,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:31:33,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2021-01-06 21:31:33,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:31:33,412 INFO L225 Difference]: With dead ends: 1370 [2021-01-06 21:31:33,412 INFO L226 Difference]: Without dead ends: 688 [2021-01-06 21:31:33,414 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:31:33,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2021-01-06 21:31:33,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 687. [2021-01-06 21:31:33,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2021-01-06 21:31:33,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 964 transitions. [2021-01-06 21:31:33,441 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 964 transitions. Word has length 40 [2021-01-06 21:31:33,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:31:33,441 INFO L481 AbstractCegarLoop]: Abstraction has 687 states and 964 transitions. [2021-01-06 21:31:33,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:31:33,441 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 964 transitions. [2021-01-06 21:31:33,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-06 21:31:33,443 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:31:33,444 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] [2021-01-06 21:31:33,658 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-01-06 21:31:33,659 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:31:33,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:31:33,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1501880901, now seen corresponding path program 2 times [2021-01-06 21:31:33,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:31:33,660 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84089299] [2021-01-06 21:31:33,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:31:33,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:31:33,830 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 21:31:33,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84089299] [2021-01-06 21:31:33,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063427066] [2021-01-06 21:31:33,832 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 21:31:34,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-01-06 21:31:34,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 21:31:34,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-06 21:31:34,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 21:31:34,158 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-06 21:31:34,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 21:31:34,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-01-06 21:31:34,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463260988] [2021-01-06 21:31:34,160 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:31:34,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:31:34,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:31:34,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:31:34,161 INFO L87 Difference]: Start difference. First operand 687 states and 964 transitions. Second operand 3 states. [2021-01-06 21:31:34,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:31:34,186 INFO L93 Difference]: Finished difference Result 1200 states and 1683 transitions. [2021-01-06 21:31:34,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:31:34,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2021-01-06 21:31:34,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:31:34,191 INFO L225 Difference]: With dead ends: 1200 [2021-01-06 21:31:34,192 INFO L226 Difference]: Without dead ends: 687 [2021-01-06 21:31:34,193 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:31:34,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2021-01-06 21:31:34,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2021-01-06 21:31:34,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2021-01-06 21:31:34,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 963 transitions. [2021-01-06 21:31:34,212 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 963 transitions. Word has length 42 [2021-01-06 21:31:34,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:31:34,212 INFO L481 AbstractCegarLoop]: Abstraction has 687 states and 963 transitions. [2021-01-06 21:31:34,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:31:34,213 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 963 transitions. [2021-01-06 21:31:34,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 21:31:34,215 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:31:34,215 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] [2021-01-06 21:31:34,430 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 21:31:34,431 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:31:34,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:31:34,432 INFO L82 PathProgramCache]: Analyzing trace with hash -658218326, now seen corresponding path program 1 times [2021-01-06 21:31:34,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:31:34,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588248232] [2021-01-06 21:31:34,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:31:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:31:34,560 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 21:31:34,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588248232] [2021-01-06 21:31:34,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166955391] [2021-01-06 21:31:34,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 21:31:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:31:34,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-06 21:31:34,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 21:31:34,879 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:31:34,880 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 21:31:34,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2021-01-06 21:31:34,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834909889] [2021-01-06 21:31:34,882 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 21:31:34,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:31:34,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 21:31:34,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 21:31:34,884 INFO L87 Difference]: Start difference. First operand 687 states and 963 transitions. Second operand 7 states. [2021-01-06 21:31:35,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:31:35,113 INFO L93 Difference]: Finished difference Result 1385 states and 1941 transitions. [2021-01-06 21:31:35,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 21:31:35,114 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2021-01-06 21:31:35,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:31:35,119 INFO L225 Difference]: With dead ends: 1385 [2021-01-06 21:31:35,119 INFO L226 Difference]: Without dead ends: 701 [2021-01-06 21:31:35,121 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2021-01-06 21:31:35,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2021-01-06 21:31:35,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 699. [2021-01-06 21:31:35,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2021-01-06 21:31:35,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 976 transitions. [2021-01-06 21:31:35,143 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 976 transitions. Word has length 52 [2021-01-06 21:31:35,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:31:35,143 INFO L481 AbstractCegarLoop]: Abstraction has 699 states and 976 transitions. [2021-01-06 21:31:35,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 21:31:35,143 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 976 transitions. [2021-01-06 21:31:35,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-01-06 21:31:35,145 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:31:35,146 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] [2021-01-06 21:31:35,361 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 21:31:35,362 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:31:35,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:31:35,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1628003094, now seen corresponding path program 2 times [2021-01-06 21:31:35,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:31:35,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884759668] [2021-01-06 21:31:35,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:31:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:31:35,616 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-06 21:31:35,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884759668] [2021-01-06 21:31:35,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476506808] [2021-01-06 21:31:35,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 21:31:35,897 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-01-06 21:31:35,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 21:31:35,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-06 21:31:35,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 21:31:35,984 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-01-06 21:31:35,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 21:31:35,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2021-01-06 21:31:35,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180433473] [2021-01-06 21:31:35,986 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:31:35,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:31:35,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:31:35,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-01-06 21:31:35,987 INFO L87 Difference]: Start difference. First operand 699 states and 976 transitions. Second operand 4 states. [2021-01-06 21:31:36,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:31:36,141 INFO L93 Difference]: Finished difference Result 1267 states and 1771 transitions. [2021-01-06 21:31:36,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:31:36,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2021-01-06 21:31:36,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:31:36,149 INFO L225 Difference]: With dead ends: 1267 [2021-01-06 21:31:36,150 INFO L226 Difference]: Without dead ends: 1210 [2021-01-06 21:31:36,151 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-01-06 21:31:36,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2021-01-06 21:31:36,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1207. [2021-01-06 21:31:36,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1207 states. [2021-01-06 21:31:36,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1680 transitions. [2021-01-06 21:31:36,186 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 1680 transitions. Word has length 64 [2021-01-06 21:31:36,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:31:36,187 INFO L481 AbstractCegarLoop]: Abstraction has 1207 states and 1680 transitions. [2021-01-06 21:31:36,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:31:36,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1680 transitions. [2021-01-06 21:31:36,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-01-06 21:31:36,190 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:31:36,190 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] [2021-01-06 21:31:36,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 21:31:36,404 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:31:36,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:31:36,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1199066972, now seen corresponding path program 1 times [2021-01-06 21:31:36,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:31:36,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847362739] [2021-01-06 21:31:36,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:31:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:31:36,663 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-01-06 21:31:36,664 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847362739] [2021-01-06 21:31:36,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:31:36,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:31:36,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076423240] [2021-01-06 21:31:36,665 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:31:36,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:31:36,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:31:36,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:31:36,666 INFO L87 Difference]: Start difference. First operand 1207 states and 1680 transitions. Second operand 4 states. [2021-01-06 21:31:37,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:31:37,220 INFO L93 Difference]: Finished difference Result 3333 states and 4626 transitions. [2021-01-06 21:31:37,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:31:37,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2021-01-06 21:31:37,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:31:37,235 INFO L225 Difference]: With dead ends: 3333 [2021-01-06 21:31:37,235 INFO L226 Difference]: Without dead ends: 2287 [2021-01-06 21:31:37,244 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:31:37,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2287 states. [2021-01-06 21:31:37,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2287 to 1133. [2021-01-06 21:31:37,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1133 states. [2021-01-06 21:31:37,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1577 transitions. [2021-01-06 21:31:37,297 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1577 transitions. Word has length 79 [2021-01-06 21:31:37,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:31:37,297 INFO L481 AbstractCegarLoop]: Abstraction has 1133 states and 1577 transitions. [2021-01-06 21:31:37,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:31:37,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1577 transitions. [2021-01-06 21:31:37,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 21:31:37,300 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:31:37,301 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] [2021-01-06 21:31:37,301 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 21:31:37,301 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:31:37,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:31:37,303 INFO L82 PathProgramCache]: Analyzing trace with hash 433653681, now seen corresponding path program 1 times [2021-01-06 21:31:37,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:31:37,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269789268] [2021-01-06 21:31:37,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:31:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:31:37,447 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-01-06 21:31:37,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269789268] [2021-01-06 21:31:37,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:31:37,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:31:37,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125409379] [2021-01-06 21:31:37,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:31:37,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:31:37,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:31:37,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:31:37,450 INFO L87 Difference]: Start difference. First operand 1133 states and 1577 transitions. Second operand 4 states. [2021-01-06 21:31:37,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:31:37,983 INFO L93 Difference]: Finished difference Result 3259 states and 4523 transitions. [2021-01-06 21:31:37,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:31:37,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2021-01-06 21:31:37,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:31:37,999 INFO L225 Difference]: With dead ends: 3259 [2021-01-06 21:31:38,000 INFO L226 Difference]: Without dead ends: 2252 [2021-01-06 21:31:38,003 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:31:38,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2252 states. [2021-01-06 21:31:38,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2252 to 1098. [2021-01-06 21:31:38,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1098 states. [2021-01-06 21:31:38,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1529 transitions. [2021-01-06 21:31:38,058 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1529 transitions. Word has length 85 [2021-01-06 21:31:38,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:31:38,058 INFO L481 AbstractCegarLoop]: Abstraction has 1098 states and 1529 transitions. [2021-01-06 21:31:38,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:31:38,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1529 transitions. [2021-01-06 21:31:38,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-01-06 21:31:38,061 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:31:38,061 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] [2021-01-06 21:31:38,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 21:31:38,062 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:31:38,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:31:38,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1439220965, now seen corresponding path program 1 times [2021-01-06 21:31:38,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:31:38,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199689541] [2021-01-06 21:31:38,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:31:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:31:38,305 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-01-06 21:31:38,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199689541] [2021-01-06 21:31:38,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:31:38,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:31:38,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579030918] [2021-01-06 21:31:38,306 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:31:38,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:31:38,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:31:38,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:31:38,307 INFO L87 Difference]: Start difference. First operand 1098 states and 1529 transitions. Second operand 4 states. [2021-01-06 21:31:40,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:31:40,829 INFO L93 Difference]: Finished difference Result 2508 states and 3469 transitions. [2021-01-06 21:31:40,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:31:40,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2021-01-06 21:31:40,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:31:40,840 INFO L225 Difference]: With dead ends: 2508 [2021-01-06 21:31:40,840 INFO L226 Difference]: Without dead ends: 1929 [2021-01-06 21:31:40,842 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:31:40,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2021-01-06 21:31:40,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1527. [2021-01-06 21:31:40,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1527 states. [2021-01-06 21:31:40,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 2140 transitions. [2021-01-06 21:31:40,896 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 2140 transitions. Word has length 89 [2021-01-06 21:31:40,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:31:40,897 INFO L481 AbstractCegarLoop]: Abstraction has 1527 states and 2140 transitions. [2021-01-06 21:31:40,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:31:40,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 2140 transitions. [2021-01-06 21:31:40,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-01-06 21:31:40,900 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:31:40,900 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] [2021-01-06 21:31:40,901 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 21:31:40,901 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:31:40,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:31:40,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1675812355, now seen corresponding path program 1 times [2021-01-06 21:31:40,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:31:40,902 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091183654] [2021-01-06 21:31:40,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:31:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:31:41,068 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-01-06 21:31:41,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091183654] [2021-01-06 21:31:41,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:31:41,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:31:41,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105965819] [2021-01-06 21:31:41,069 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:31:41,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:31:41,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:31:41,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:31:41,071 INFO L87 Difference]: Start difference. First operand 1527 states and 2140 transitions. Second operand 4 states. [2021-01-06 21:31:43,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:31:43,503 INFO L93 Difference]: Finished difference Result 1952 states and 2691 transitions. [2021-01-06 21:31:43,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:31:43,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2021-01-06 21:31:43,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:31:43,516 INFO L225 Difference]: With dead ends: 1952 [2021-01-06 21:31:43,516 INFO L226 Difference]: Without dead ends: 1691 [2021-01-06 21:31:43,520 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:31:43,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2021-01-06 21:31:43,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1595. [2021-01-06 21:31:43,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1595 states. [2021-01-06 21:31:43,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 2231 transitions. [2021-01-06 21:31:43,575 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 2231 transitions. Word has length 89 [2021-01-06 21:31:43,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:31:43,576 INFO L481 AbstractCegarLoop]: Abstraction has 1595 states and 2231 transitions. [2021-01-06 21:31:43,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:31:43,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 2231 transitions. [2021-01-06 21:31:43,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-01-06 21:31:43,579 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:31:43,580 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] [2021-01-06 21:31:43,580 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 21:31:43,580 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:31:43,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:31:43,581 INFO L82 PathProgramCache]: Analyzing trace with hash -729730189, now seen corresponding path program 1 times [2021-01-06 21:31:43,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:31:43,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670663719] [2021-01-06 21:31:43,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:31:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:31:43,819 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-01-06 21:31:43,820 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670663719] [2021-01-06 21:31:43,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:31:43,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:31:43,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554396874] [2021-01-06 21:31:43,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:31:43,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:31:43,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:31:43,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:31:43,822 INFO L87 Difference]: Start difference. First operand 1595 states and 2231 transitions. Second operand 4 states. [2021-01-06 21:31:46,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:31:46,206 INFO L93 Difference]: Finished difference Result 2544 states and 3520 transitions. [2021-01-06 21:31:46,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:31:46,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2021-01-06 21:31:46,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:31:46,216 INFO L225 Difference]: With dead ends: 2544 [2021-01-06 21:31:46,216 INFO L226 Difference]: Without dead ends: 1442 [2021-01-06 21:31:46,219 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:31:46,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2021-01-06 21:31:46,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1338. [2021-01-06 21:31:46,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1338 states. [2021-01-06 21:31:46,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 1860 transitions. [2021-01-06 21:31:46,261 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 1860 transitions. Word has length 89 [2021-01-06 21:31:46,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:31:46,261 INFO L481 AbstractCegarLoop]: Abstraction has 1338 states and 1860 transitions. [2021-01-06 21:31:46,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:31:46,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1860 transitions. [2021-01-06 21:31:46,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-06 21:31:46,265 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:31:46,265 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] [2021-01-06 21:31:46,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 21:31:46,266 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:31:46,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:31:46,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1874323918, now seen corresponding path program 1 times [2021-01-06 21:31:46,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:31:46,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438445744] [2021-01-06 21:31:46,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:31:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:31:46,387 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-06 21:31:46,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438445744] [2021-01-06 21:31:46,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272247606] [2021-01-06 21:31:46,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 21:31:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:31:46,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 21:31:46,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 21:31:46,819 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-06 21:31:46,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 21:31:46,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-01-06 21:31:46,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277999656] [2021-01-06 21:31:46,825 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 21:31:46,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:31:46,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 21:31:46,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-06 21:31:46,826 INFO L87 Difference]: Start difference. First operand 1338 states and 1860 transitions. Second operand 7 states. [2021-01-06 21:31:46,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:31:46,943 INFO L93 Difference]: Finished difference Result 2670 states and 3715 transitions. [2021-01-06 21:31:46,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 21:31:46,945 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2021-01-06 21:31:46,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:31:46,952 INFO L225 Difference]: With dead ends: 2670 [2021-01-06 21:31:46,952 INFO L226 Difference]: Without dead ends: 1342 [2021-01-06 21:31:46,955 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-06 21:31:46,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2021-01-06 21:31:47,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1342. [2021-01-06 21:31:47,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2021-01-06 21:31:47,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1864 transitions. [2021-01-06 21:31:47,011 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1864 transitions. Word has length 95 [2021-01-06 21:31:47,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:31:47,012 INFO L481 AbstractCegarLoop]: Abstraction has 1342 states and 1864 transitions. [2021-01-06 21:31:47,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 21:31:47,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1864 transitions. [2021-01-06 21:31:47,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-01-06 21:31:47,019 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:31:47,019 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 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] [2021-01-06 21:31:47,234 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-01-06 21:31:47,235 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:31:47,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:31:47,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1597252682, now seen corresponding path program 2 times [2021-01-06 21:31:47,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:31:47,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425175773] [2021-01-06 21:31:47,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:31:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:31:50,218 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2021-01-06 21:31:50,751 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-01-06 21:31:50,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425175773] [2021-01-06 21:31:50,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:31:50,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:31:50,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531670980] [2021-01-06 21:31:50,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 21:31:50,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:31:50,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 21:31:50,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:31:50,753 INFO L87 Difference]: Start difference. First operand 1342 states and 1864 transitions. Second operand 6 states. [2021-01-06 21:31:54,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:31:54,526 INFO L93 Difference]: Finished difference Result 1619 states and 2211 transitions. [2021-01-06 21:31:54,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 21:31:54,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2021-01-06 21:31:54,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:31:54,536 INFO L225 Difference]: With dead ends: 1619 [2021-01-06 21:31:54,536 INFO L226 Difference]: Without dead ends: 1473 [2021-01-06 21:31:54,538 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 11 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-01-06 21:31:54,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2021-01-06 21:31:54,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1393. [2021-01-06 21:31:54,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1393 states. [2021-01-06 21:31:54,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 1931 transitions. [2021-01-06 21:31:54,597 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 1931 transitions. Word has length 99 [2021-01-06 21:31:54,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:31:54,597 INFO L481 AbstractCegarLoop]: Abstraction has 1393 states and 1931 transitions. [2021-01-06 21:31:54,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 21:31:54,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1931 transitions. [2021-01-06 21:31:54,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-01-06 21:31:54,602 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:31:54,602 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 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] [2021-01-06 21:31:54,602 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 21:31:54,603 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:31:54,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:31:54,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1331256986, now seen corresponding path program 1 times [2021-01-06 21:31:54,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:31:54,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219625018] [2021-01-06 21:31:54,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:31:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:31:55,596 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2021-01-06 21:31:55,920 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2021-01-06 21:31:56,079 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-01-06 21:31:56,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219625018] [2021-01-06 21:31:56,080 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:31:56,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:31:56,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379020826] [2021-01-06 21:31:56,081 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 21:31:56,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:31:56,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 21:31:56,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:31:56,082 INFO L87 Difference]: Start difference. First operand 1393 states and 1931 transitions. Second operand 6 states. [2021-01-06 21:31:59,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:31:59,759 INFO L93 Difference]: Finished difference Result 1499 states and 2051 transitions. [2021-01-06 21:31:59,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 21:31:59,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2021-01-06 21:31:59,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:31:59,767 INFO L225 Difference]: With dead ends: 1499 [2021-01-06 21:31:59,768 INFO L226 Difference]: Without dead ends: 1407 [2021-01-06 21:31:59,769 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-01-06 21:31:59,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2021-01-06 21:31:59,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1383. [2021-01-06 21:31:59,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1383 states. [2021-01-06 21:31:59,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 1913 transitions. [2021-01-06 21:31:59,820 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 1913 transitions. Word has length 99 [2021-01-06 21:31:59,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:31:59,820 INFO L481 AbstractCegarLoop]: Abstraction has 1383 states and 1913 transitions. [2021-01-06 21:31:59,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 21:31:59,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 1913 transitions. [2021-01-06 21:31:59,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-01-06 21:31:59,825 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:31:59,825 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 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] [2021-01-06 21:31:59,826 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 21:31:59,826 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:31:59,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:31:59,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1665542160, now seen corresponding path program 1 times [2021-01-06 21:31:59,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:31:59,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719606156] [2021-01-06 21:31:59,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:32:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:32:00,865 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 39 [2021-01-06 21:32:01,248 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-01-06 21:32:01,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719606156] [2021-01-06 21:32:01,249 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:32:01,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:32:01,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635644906] [2021-01-06 21:32:01,250 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 21:32:01,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:32:01,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 21:32:01,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:32:01,251 INFO L87 Difference]: Start difference. First operand 1383 states and 1913 transitions. Second operand 6 states. [2021-01-06 21:32:04,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:32:04,790 INFO L93 Difference]: Finished difference Result 1566 states and 2146 transitions. [2021-01-06 21:32:04,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 21:32:04,790 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2021-01-06 21:32:04,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:32:04,798 INFO L225 Difference]: With dead ends: 1566 [2021-01-06 21:32:04,798 INFO L226 Difference]: Without dead ends: 1342 [2021-01-06 21:32:04,799 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-01-06 21:32:04,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2021-01-06 21:32:04,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1342. [2021-01-06 21:32:04,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2021-01-06 21:32:04,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1862 transitions. [2021-01-06 21:32:04,843 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1862 transitions. Word has length 99 [2021-01-06 21:32:04,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:32:04,843 INFO L481 AbstractCegarLoop]: Abstraction has 1342 states and 1862 transitions. [2021-01-06 21:32:04,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 21:32:04,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1862 transitions. [2021-01-06 21:32:04,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-01-06 21:32:04,847 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:32:04,847 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 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] [2021-01-06 21:32:04,848 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 21:32:04,848 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:32:04,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:32:04,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1921827172, now seen corresponding path program 1 times [2021-01-06 21:32:04,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:32:04,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226371587] [2021-01-06 21:32:04,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:32:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:32:04,997 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-01-06 21:32:04,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226371587] [2021-01-06 21:32:04,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:32:04,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:32:04,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659561470] [2021-01-06 21:32:04,998 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:32:04,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:32:04,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:32:04,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:32:04,999 INFO L87 Difference]: Start difference. First operand 1342 states and 1862 transitions. Second operand 3 states. [2021-01-06 21:32:05,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:32:05,336 INFO L93 Difference]: Finished difference Result 2395 states and 3335 transitions. [2021-01-06 21:32:05,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:32:05,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2021-01-06 21:32:05,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:32:05,342 INFO L225 Difference]: With dead ends: 2395 [2021-01-06 21:32:05,343 INFO L226 Difference]: Without dead ends: 1102 [2021-01-06 21:32:05,346 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:32:05,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2021-01-06 21:32:05,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1102. [2021-01-06 21:32:05,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1102 states. [2021-01-06 21:32:05,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1530 transitions. [2021-01-06 21:32:05,384 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1530 transitions. Word has length 102 [2021-01-06 21:32:05,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:32:05,384 INFO L481 AbstractCegarLoop]: Abstraction has 1102 states and 1530 transitions. [2021-01-06 21:32:05,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:32:05,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1530 transitions. [2021-01-06 21:32:05,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-01-06 21:32:05,389 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:32:05,389 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 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] [2021-01-06 21:32:05,390 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 21:32:05,390 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:32:05,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:32:05,391 INFO L82 PathProgramCache]: Analyzing trace with hash -411565466, now seen corresponding path program 1 times [2021-01-06 21:32:05,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:32:05,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304533110] [2021-01-06 21:32:05,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:32:05,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:32:05,609 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-01-06 21:32:05,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304533110] [2021-01-06 21:32:05,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:32:05,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:32:05,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173553773] [2021-01-06 21:32:05,611 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:32:05,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:32:05,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:32:05,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:32:05,612 INFO L87 Difference]: Start difference. First operand 1102 states and 1530 transitions. Second operand 4 states. [2021-01-06 21:32:06,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:32:06,246 INFO L93 Difference]: Finished difference Result 2715 states and 3762 transitions. [2021-01-06 21:32:06,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:32:06,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2021-01-06 21:32:06,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:32:06,259 INFO L225 Difference]: With dead ends: 2715 [2021-01-06 21:32:06,259 INFO L226 Difference]: Without dead ends: 1662 [2021-01-06 21:32:06,262 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:32:06,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2021-01-06 21:32:06,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1480. [2021-01-06 21:32:06,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2021-01-06 21:32:06,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2050 transitions. [2021-01-06 21:32:06,363 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2050 transitions. Word has length 102 [2021-01-06 21:32:06,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:32:06,364 INFO L481 AbstractCegarLoop]: Abstraction has 1480 states and 2050 transitions. [2021-01-06 21:32:06,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:32:06,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2050 transitions. [2021-01-06 21:32:06,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-01-06 21:32:06,369 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:32:06,370 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 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] [2021-01-06 21:32:06,370 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 21:32:06,370 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:32:06,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:32:06,371 INFO L82 PathProgramCache]: Analyzing trace with hash 464453540, now seen corresponding path program 1 times [2021-01-06 21:32:06,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:32:06,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805932469] [2021-01-06 21:32:06,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:32:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:32:06,603 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-01-06 21:32:06,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805932469] [2021-01-06 21:32:06,605 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:32:06,605 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:32:06,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434922197] [2021-01-06 21:32:06,606 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:32:06,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:32:06,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:32:06,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:32:06,608 INFO L87 Difference]: Start difference. First operand 1480 states and 2050 transitions. Second operand 5 states. [2021-01-06 21:32:09,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:32:09,459 INFO L93 Difference]: Finished difference Result 3303 states and 4554 transitions. [2021-01-06 21:32:09,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:32:09,459 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2021-01-06 21:32:09,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:32:09,470 INFO L225 Difference]: With dead ends: 3303 [2021-01-06 21:32:09,470 INFO L226 Difference]: Without dead ends: 2257 [2021-01-06 21:32:09,473 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:32:09,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2021-01-06 21:32:09,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 1893. [2021-01-06 21:32:09,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1893 states. [2021-01-06 21:32:09,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2614 transitions. [2021-01-06 21:32:09,546 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2614 transitions. Word has length 102 [2021-01-06 21:32:09,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:32:09,547 INFO L481 AbstractCegarLoop]: Abstraction has 1893 states and 2614 transitions. [2021-01-06 21:32:09,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:32:09,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2614 transitions. [2021-01-06 21:32:09,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-01-06 21:32:09,552 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:32:09,552 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 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] [2021-01-06 21:32:09,552 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 21:32:09,552 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:32:09,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:32:09,553 INFO L82 PathProgramCache]: Analyzing trace with hash 111365158, now seen corresponding path program 1 times [2021-01-06 21:32:09,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:32:09,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101143468] [2021-01-06 21:32:09,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:32:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:32:13,046 WARN L197 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 87 [2021-01-06 21:32:13,498 WARN L197 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 89 [2021-01-06 21:32:14,047 WARN L197 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 94 [2021-01-06 21:32:14,221 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 50 [2021-01-06 21:32:14,382 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 51 [2021-01-06 21:32:14,564 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 51 [2021-01-06 21:32:14,741 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 50 [2021-01-06 21:32:14,939 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 55 [2021-01-06 21:32:15,516 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-01-06 21:32:15,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101143468] [2021-01-06 21:32:15,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:32:15,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-06 21:32:15,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110222975] [2021-01-06 21:32:15,517 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 21:32:15,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:32:15,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 21:32:15,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-01-06 21:32:15,518 INFO L87 Difference]: Start difference. First operand 1893 states and 2614 transitions. Second operand 13 states. [2021-01-06 21:32:15,829 WARN L197 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2021-01-06 21:32:28,618 WARN L197 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2021-01-06 21:32:29,199 WARN L197 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 94 [2021-01-06 21:32:29,751 WARN L197 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 98 [2021-01-06 21:32:30,141 WARN L197 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 98 [2021-01-06 21:32:30,545 WARN L197 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 101 [2021-01-06 21:32:31,039 WARN L197 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 103 [2021-01-06 21:32:31,553 WARN L197 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 91 [2021-01-06 21:32:32,122 WARN L197 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 97 [2021-01-06 21:32:35,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:32:35,595 INFO L93 Difference]: Finished difference Result 2440 states and 3382 transitions. [2021-01-06 21:32:35,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 21:32:35,596 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 102 [2021-01-06 21:32:35,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:32:35,605 INFO L225 Difference]: With dead ends: 2440 [2021-01-06 21:32:35,605 INFO L226 Difference]: Without dead ends: 1893 [2021-01-06 21:32:35,607 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2021-01-06 21:32:35,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1893 states. [2021-01-06 21:32:35,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1893 to 1893. [2021-01-06 21:32:35,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1893 states. [2021-01-06 21:32:35,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2613 transitions. [2021-01-06 21:32:35,671 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2613 transitions. Word has length 102 [2021-01-06 21:32:35,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:32:35,671 INFO L481 AbstractCegarLoop]: Abstraction has 1893 states and 2613 transitions. [2021-01-06 21:32:35,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 21:32:35,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2613 transitions. [2021-01-06 21:32:35,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 21:32:35,676 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:32:35,677 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 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] [2021-01-06 21:32:35,677 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 21:32:35,677 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:32:35,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:32:35,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1044614030, now seen corresponding path program 1 times [2021-01-06 21:32:35,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:32:35,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735790476] [2021-01-06 21:32:35,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:32:35,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:32:35,820 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-01-06 21:32:35,820 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735790476] [2021-01-06 21:32:35,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:32:35,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:32:35,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17408652] [2021-01-06 21:32:35,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:32:35,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:32:35,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:32:35,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:32:35,822 INFO L87 Difference]: Start difference. First operand 1893 states and 2613 transitions. Second operand 3 states. [2021-01-06 21:32:36,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:32:36,009 INFO L93 Difference]: Finished difference Result 2953 states and 4107 transitions. [2021-01-06 21:32:36,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:32:36,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2021-01-06 21:32:36,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:32:36,018 INFO L225 Difference]: With dead ends: 2953 [2021-01-06 21:32:36,018 INFO L226 Difference]: Without dead ends: 1915 [2021-01-06 21:32:36,021 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:32:36,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states. [2021-01-06 21:32:36,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 1915. [2021-01-06 21:32:36,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1915 states. [2021-01-06 21:32:36,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1915 states and 2634 transitions. [2021-01-06 21:32:36,083 INFO L78 Accepts]: Start accepts. Automaton has 1915 states and 2634 transitions. Word has length 105 [2021-01-06 21:32:36,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:32:36,083 INFO L481 AbstractCegarLoop]: Abstraction has 1915 states and 2634 transitions. [2021-01-06 21:32:36,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:32:36,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 2634 transitions. [2021-01-06 21:32:36,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 21:32:36,088 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:32:36,088 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 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] [2021-01-06 21:32:36,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 21:32:36,089 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:32:36,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:32:36,089 INFO L82 PathProgramCache]: Analyzing trace with hash -796467536, now seen corresponding path program 1 times [2021-01-06 21:32:36,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:32:36,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762302270] [2021-01-06 21:32:36,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:32:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:32:39,264 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-01-06 21:32:39,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762302270] [2021-01-06 21:32:39,265 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:32:39,265 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:32:39,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8133033] [2021-01-06 21:32:39,266 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:32:39,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:32:39,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:32:39,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:32:39,267 INFO L87 Difference]: Start difference. First operand 1915 states and 2634 transitions. Second operand 5 states. [2021-01-06 21:32:41,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:32:41,627 INFO L93 Difference]: Finished difference Result 4788 states and 6527 transitions. [2021-01-06 21:32:41,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 21:32:41,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2021-01-06 21:32:41,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:32:41,640 INFO L225 Difference]: With dead ends: 4788 [2021-01-06 21:32:41,641 INFO L226 Difference]: Without dead ends: 2855 [2021-01-06 21:32:41,648 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:32:41,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2021-01-06 21:32:41,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 2341. [2021-01-06 21:32:41,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2341 states. [2021-01-06 21:32:41,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2341 states to 2341 states and 3036 transitions. [2021-01-06 21:32:41,787 INFO L78 Accepts]: Start accepts. Automaton has 2341 states and 3036 transitions. Word has length 105 [2021-01-06 21:32:41,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:32:41,787 INFO L481 AbstractCegarLoop]: Abstraction has 2341 states and 3036 transitions. [2021-01-06 21:32:41,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:32:41,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2341 states and 3036 transitions. [2021-01-06 21:32:41,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 21:32:41,793 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:32:41,794 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 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] [2021-01-06 21:32:41,794 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 21:32:41,794 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:32:41,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:32:41,795 INFO L82 PathProgramCache]: Analyzing trace with hash 359552114, now seen corresponding path program 1 times [2021-01-06 21:32:41,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:32:41,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103828201] [2021-01-06 21:32:41,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:32:45,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:32:46,074 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2021-01-06 21:32:46,296 WARN L197 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 53 [2021-01-06 21:32:46,577 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2021-01-06 21:32:47,013 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-01-06 21:32:47,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103828201] [2021-01-06 21:32:47,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:32:47,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 21:32:47,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369243733] [2021-01-06 21:32:47,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 21:32:47,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:32:47,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 21:32:47,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-01-06 21:32:47,039 INFO L87 Difference]: Start difference. First operand 2341 states and 3036 transitions. Second operand 14 states. [2021-01-06 21:32:58,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:32:58,425 INFO L93 Difference]: Finished difference Result 6003 states and 7727 transitions. [2021-01-06 21:32:58,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 21:32:58,426 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 105 [2021-01-06 21:32:58,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:32:58,437 INFO L225 Difference]: With dead ends: 6003 [2021-01-06 21:32:58,437 INFO L226 Difference]: Without dead ends: 4808 [2021-01-06 21:32:58,440 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2021-01-06 21:32:58,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4808 states. [2021-01-06 21:32:58,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4808 to 2341. [2021-01-06 21:32:58,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2341 states. [2021-01-06 21:32:58,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2341 states to 2341 states and 3032 transitions. [2021-01-06 21:32:58,546 INFO L78 Accepts]: Start accepts. Automaton has 2341 states and 3032 transitions. Word has length 105 [2021-01-06 21:32:58,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:32:58,546 INFO L481 AbstractCegarLoop]: Abstraction has 2341 states and 3032 transitions. [2021-01-06 21:32:58,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 21:32:58,547 INFO L276 IsEmpty]: Start isEmpty. Operand 2341 states and 3032 transitions. [2021-01-06 21:32:58,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-06 21:32:58,553 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:32:58,553 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 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] [2021-01-06 21:32:58,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 21:32:58,553 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:32:58,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:32:58,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1720340868, now seen corresponding path program 1 times [2021-01-06 21:32:58,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:32:58,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734787804] [2021-01-06 21:32:58,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:32:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:32:59,279 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-01-06 21:32:59,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734787804] [2021-01-06 21:32:59,280 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:32:59,280 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 21:32:59,280 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717452598] [2021-01-06 21:32:59,281 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 21:32:59,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:32:59,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 21:32:59,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 21:32:59,282 INFO L87 Difference]: Start difference. First operand 2341 states and 3032 transitions. Second operand 7 states. [2021-01-06 21:33:01,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:33:01,974 INFO L93 Difference]: Finished difference Result 4010 states and 5162 transitions. [2021-01-06 21:33:01,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 21:33:01,975 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2021-01-06 21:33:01,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:33:01,981 INFO L225 Difference]: With dead ends: 4010 [2021-01-06 21:33:01,981 INFO L226 Difference]: Without dead ends: 2459 [2021-01-06 21:33:01,984 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 21:33:01,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2459 states. [2021-01-06 21:33:02,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2459 to 2219. [2021-01-06 21:33:02,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2219 states. [2021-01-06 21:33:02,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2219 states to 2219 states and 2874 transitions. [2021-01-06 21:33:02,070 INFO L78 Accepts]: Start accepts. Automaton has 2219 states and 2874 transitions. Word has length 106 [2021-01-06 21:33:02,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:33:02,070 INFO L481 AbstractCegarLoop]: Abstraction has 2219 states and 2874 transitions. [2021-01-06 21:33:02,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 21:33:02,071 INFO L276 IsEmpty]: Start isEmpty. Operand 2219 states and 2874 transitions. [2021-01-06 21:33:02,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-01-06 21:33:02,078 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:33:02,078 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 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] [2021-01-06 21:33:02,079 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 21:33:02,079 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:33:02,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:33:02,079 INFO L82 PathProgramCache]: Analyzing trace with hash 2038425429, now seen corresponding path program 1 times [2021-01-06 21:33:02,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:33:02,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446415674] [2021-01-06 21:33:02,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:33:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:33:03,215 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-01-06 21:33:03,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446415674] [2021-01-06 21:33:03,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:33:03,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:33:03,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105219929] [2021-01-06 21:33:03,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:33:03,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:33:03,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:33:03,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:33:03,217 INFO L87 Difference]: Start difference. First operand 2219 states and 2874 transitions. Second operand 4 states. [2021-01-06 21:33:05,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:33:05,460 INFO L93 Difference]: Finished difference Result 4918 states and 6343 transitions. [2021-01-06 21:33:05,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:33:05,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2021-01-06 21:33:05,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:33:05,466 INFO L225 Difference]: With dead ends: 4918 [2021-01-06 21:33:05,466 INFO L226 Difference]: Without dead ends: 2850 [2021-01-06 21:33:05,480 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:33:05,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2850 states. [2021-01-06 21:33:05,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2850 to 2605. [2021-01-06 21:33:05,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2605 states. [2021-01-06 21:33:05,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 3193 transitions. [2021-01-06 21:33:05,603 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 3193 transitions. Word has length 112 [2021-01-06 21:33:05,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:33:05,604 INFO L481 AbstractCegarLoop]: Abstraction has 2605 states and 3193 transitions. [2021-01-06 21:33:05,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:33:05,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 3193 transitions. [2021-01-06 21:33:05,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-01-06 21:33:05,612 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:33:05,613 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 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] [2021-01-06 21:33:05,613 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 21:33:05,613 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:33:05,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:33:05,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1040388141, now seen corresponding path program 1 times [2021-01-06 21:33:05,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:33:05,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986411116] [2021-01-06 21:33:05,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:33:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:33:07,762 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-01-06 21:33:07,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986411116] [2021-01-06 21:33:07,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:33:07,763 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:33:07,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423627552] [2021-01-06 21:33:07,764 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 21:33:07,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:33:07,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 21:33:07,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:33:07,765 INFO L87 Difference]: Start difference. First operand 2605 states and 3193 transitions. Second operand 6 states. [2021-01-06 21:33:10,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:33:10,314 INFO L93 Difference]: Finished difference Result 5259 states and 6434 transitions. [2021-01-06 21:33:10,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 21:33:10,314 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2021-01-06 21:33:10,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:33:10,324 INFO L225 Difference]: With dead ends: 5259 [2021-01-06 21:33:10,324 INFO L226 Difference]: Without dead ends: 2859 [2021-01-06 21:33:10,328 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-01-06 21:33:10,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2021-01-06 21:33:10,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 2567. [2021-01-06 21:33:10,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2567 states. [2021-01-06 21:33:10,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2567 states to 2567 states and 3119 transitions. [2021-01-06 21:33:10,462 INFO L78 Accepts]: Start accepts. Automaton has 2567 states and 3119 transitions. Word has length 112 [2021-01-06 21:33:10,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:33:10,463 INFO L481 AbstractCegarLoop]: Abstraction has 2567 states and 3119 transitions. [2021-01-06 21:33:10,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 21:33:10,463 INFO L276 IsEmpty]: Start isEmpty. Operand 2567 states and 3119 transitions. [2021-01-06 21:33:10,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-01-06 21:33:10,468 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:33:10,469 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 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] [2021-01-06 21:33:10,469 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 21:33:10,469 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:33:10,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:33:10,470 INFO L82 PathProgramCache]: Analyzing trace with hash 468535062, now seen corresponding path program 1 times [2021-01-06 21:33:10,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:33:10,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494995505] [2021-01-06 21:33:10,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:33:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:33:11,374 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-01-06 21:33:11,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494995505] [2021-01-06 21:33:11,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:33:11,374 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:33:11,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886841627] [2021-01-06 21:33:11,375 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:33:11,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:33:11,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:33:11,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:33:11,376 INFO L87 Difference]: Start difference. First operand 2567 states and 3119 transitions. Second operand 4 states. [2021-01-06 21:33:13,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:33:13,459 INFO L93 Difference]: Finished difference Result 5176 states and 6258 transitions. [2021-01-06 21:33:13,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:33:13,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2021-01-06 21:33:13,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:33:13,468 INFO L225 Difference]: With dead ends: 5176 [2021-01-06 21:33:13,468 INFO L226 Difference]: Without dead ends: 2808 [2021-01-06 21:33:13,471 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:33:13,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2808 states. [2021-01-06 21:33:13,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2808 to 2756. [2021-01-06 21:33:13,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2756 states. [2021-01-06 21:33:13,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2756 states to 2756 states and 3306 transitions. [2021-01-06 21:33:13,619 INFO L78 Accepts]: Start accepts. Automaton has 2756 states and 3306 transitions. Word has length 113 [2021-01-06 21:33:13,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:33:13,620 INFO L481 AbstractCegarLoop]: Abstraction has 2756 states and 3306 transitions. [2021-01-06 21:33:13,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:33:13,620 INFO L276 IsEmpty]: Start isEmpty. Operand 2756 states and 3306 transitions. [2021-01-06 21:33:13,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-01-06 21:33:13,626 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:33:13,626 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 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] [2021-01-06 21:33:13,626 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 21:33:13,626 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:33:13,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:33:13,627 INFO L82 PathProgramCache]: Analyzing trace with hash 638334226, now seen corresponding path program 1 times [2021-01-06 21:33:13,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:33:13,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349226137] [2021-01-06 21:33:13,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:33:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:33:20,362 WARN L197 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2021-01-06 21:33:20,784 WARN L197 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 89 [2021-01-06 21:33:21,411 WARN L197 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 101 [2021-01-06 21:33:22,002 WARN L197 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 95 [2021-01-06 21:33:22,431 WARN L197 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 87 [2021-01-06 21:33:22,854 WARN L197 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 86 [2021-01-06 21:33:23,297 WARN L197 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 83 [2021-01-06 21:33:23,561 WARN L197 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2021-01-06 21:33:23,926 WARN L197 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 73 [2021-01-06 21:33:24,407 WARN L197 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 78 [2021-01-06 21:33:24,813 WARN L197 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 75 [2021-01-06 21:33:25,298 WARN L197 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2021-01-06 21:33:25,698 WARN L197 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 75 [2021-01-06 21:33:26,247 WARN L197 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 71 [2021-01-06 21:33:26,728 WARN L197 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 76 [2021-01-06 21:33:27,628 WARN L197 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 77 [2021-01-06 21:33:28,060 WARN L197 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 72 [2021-01-06 21:33:28,473 WARN L197 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 71 [2021-01-06 21:33:28,788 WARN L197 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 62 [2021-01-06 21:33:29,045 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2021-01-06 21:33:29,258 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2021-01-06 21:33:29,870 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-01-06 21:33:29,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349226137] [2021-01-06 21:33:29,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:33:29,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-01-06 21:33:29,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049392965] [2021-01-06 21:33:29,871 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-01-06 21:33:29,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:33:29,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-01-06 21:33:29,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2021-01-06 21:33:29,872 INFO L87 Difference]: Start difference. First operand 2756 states and 3306 transitions. Second operand 25 states. [2021-01-06 21:33:30,216 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2021-01-06 21:33:47,240 WARN L197 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2021-01-06 21:33:47,689 WARN L197 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-01-06 21:33:48,043 WARN L197 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2021-01-06 21:33:48,502 WARN L197 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2021-01-06 21:33:49,932 WARN L197 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 79 [2021-01-06 21:33:50,396 WARN L197 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2021-01-06 21:33:51,269 WARN L197 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2021-01-06 21:33:51,984 WARN L197 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 94 [2021-01-06 21:33:53,023 WARN L197 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2021-01-06 21:33:53,915 WARN L197 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 86 [2021-01-06 21:33:55,558 WARN L197 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 101 [2021-01-06 21:33:56,624 WARN L197 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 90 [2021-01-06 21:33:57,491 WARN L197 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 97 [2021-01-06 21:33:58,411 WARN L197 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 87 [2021-01-06 21:33:59,376 WARN L197 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 98 [2021-01-06 21:34:15,633 WARN L197 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 100 [2021-01-06 21:34:16,250 WARN L197 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 111 [2021-01-06 21:34:18,222 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-01-06 21:34:18,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:34:18,954 INFO L93 Difference]: Finished difference Result 3361 states and 3995 transitions. [2021-01-06 21:34:18,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-01-06 21:34:18,955 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 113 [2021-01-06 21:34:18,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:34:18,959 INFO L225 Difference]: With dead ends: 3361 [2021-01-06 21:34:18,960 INFO L226 Difference]: Without dead ends: 3248 [2021-01-06 21:34:18,962 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=246, Invalid=1734, Unknown=0, NotChecked=0, Total=1980 [2021-01-06 21:34:18,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3248 states. [2021-01-06 21:34:19,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3248 to 3127. [2021-01-06 21:34:19,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2021-01-06 21:34:19,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 3739 transitions. [2021-01-06 21:34:19,150 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 3739 transitions. Word has length 113 [2021-01-06 21:34:19,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:34:19,150 INFO L481 AbstractCegarLoop]: Abstraction has 3127 states and 3739 transitions. [2021-01-06 21:34:19,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2021-01-06 21:34:19,150 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 3739 transitions. [2021-01-06 21:34:19,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-01-06 21:34:19,156 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:34:19,156 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 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] [2021-01-06 21:34:19,157 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 21:34:19,157 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:34:19,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:34:19,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1096175982, now seen corresponding path program 1 times [2021-01-06 21:34:19,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:34:19,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880528515] [2021-01-06 21:34:19,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:34:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:34:23,633 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2021-01-06 21:34:24,006 WARN L197 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 67 [2021-01-06 21:34:24,393 WARN L197 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 81 [2021-01-06 21:34:24,771 WARN L197 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 78 [2021-01-06 21:34:25,126 WARN L197 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 78 [2021-01-06 21:34:25,563 WARN L197 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 80 [2021-01-06 21:34:25,911 WARN L197 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 69 [2021-01-06 21:34:26,354 WARN L197 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 75 [2021-01-06 21:34:27,025 WARN L197 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 92 [2021-01-06 21:34:27,574 WARN L197 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 94 [2021-01-06 21:34:28,191 WARN L197 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 98 [2021-01-06 21:34:28,711 WARN L197 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 97 [2021-01-06 21:34:29,223 WARN L197 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 97 [2021-01-06 21:34:29,856 WARN L197 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 91 [2021-01-06 21:34:30,419 WARN L197 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 88 [2021-01-06 21:34:31,378 WARN L197 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 87 [2021-01-06 21:34:31,836 WARN L197 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 84 [2021-01-06 21:34:32,343 WARN L197 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 80 [2021-01-06 21:34:32,798 WARN L197 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 87 [2021-01-06 21:34:33,122 WARN L197 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2021-01-06 21:34:33,387 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2021-01-06 21:34:34,113 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-01-06 21:34:34,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880528515] [2021-01-06 21:34:34,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:34:34,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-01-06 21:34:34,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044561227] [2021-01-06 21:34:34,114 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-01-06 21:34:34,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:34:34,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-01-06 21:34:34,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2021-01-06 21:34:34,115 INFO L87 Difference]: Start difference. First operand 3127 states and 3739 transitions. Second operand 26 states. [2021-01-06 21:34:34,493 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-01-06 21:34:36,973 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-01-06 21:34:37,255 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-01-06 21:34:37,579 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-01-06 21:34:38,962 WARN L197 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2021-01-06 21:34:39,622 WARN L197 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 101 [2021-01-06 21:34:40,841 WARN L197 SmtUtils]: Spent 711.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 102 [2021-01-06 21:34:41,666 WARN L197 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 114 [2021-01-06 21:34:42,801 WARN L197 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 103 [2021-01-06 21:34:44,698 WARN L197 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-01-06 21:34:45,512 WARN L197 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2021-01-06 21:34:47,175 WARN L197 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 124 [2021-01-06 21:34:48,629 WARN L197 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 119 [2021-01-06 21:34:50,109 WARN L197 SmtUtils]: Spent 641.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 121 [2021-01-06 21:35:05,565 WARN L197 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 132 [2021-01-06 21:35:07,174 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-01-06 21:35:07,789 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2021-01-06 21:35:07,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:35:07,793 INFO L93 Difference]: Finished difference Result 3420 states and 4057 transitions. [2021-01-06 21:35:07,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-01-06 21:35:07,793 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 113 [2021-01-06 21:35:07,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:35:07,797 INFO L225 Difference]: With dead ends: 3420 [2021-01-06 21:35:07,797 INFO L226 Difference]: Without dead ends: 3219 [2021-01-06 21:35:07,799 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=219, Invalid=1587, Unknown=0, NotChecked=0, Total=1806 [2021-01-06 21:35:07,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3219 states. [2021-01-06 21:35:07,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3219 to 2978. [2021-01-06 21:35:07,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2978 states. [2021-01-06 21:35:07,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2978 states to 2978 states and 3566 transitions. [2021-01-06 21:35:07,972 INFO L78 Accepts]: Start accepts. Automaton has 2978 states and 3566 transitions. Word has length 113 [2021-01-06 21:35:07,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:35:07,972 INFO L481 AbstractCegarLoop]: Abstraction has 2978 states and 3566 transitions. [2021-01-06 21:35:07,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2021-01-06 21:35:07,972 INFO L276 IsEmpty]: Start isEmpty. Operand 2978 states and 3566 transitions. [2021-01-06 21:35:07,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-01-06 21:35:07,978 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:35:07,978 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 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] [2021-01-06 21:35:07,978 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 21:35:07,978 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:35:07,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:35:07,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1293287081, now seen corresponding path program 1 times [2021-01-06 21:35:07,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:35:07,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679105453] [2021-01-06 21:35:07,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:35:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:35:08,645 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 22 [2021-01-06 21:35:08,780 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 25 [2021-01-06 21:35:08,911 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21