/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/product-lines/email_spec27_product13.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 18:45:13,956 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 18:45:13,959 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 18:45:14,001 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 18:45:14,001 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 18:45:14,004 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 18:45:14,006 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 18:45:14,009 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 18:45:14,011 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 18:45:14,012 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 18:45:14,014 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 18:45:14,015 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 18:45:14,016 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 18:45:14,017 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 18:45:14,019 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 18:45:14,020 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 18:45:14,022 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 18:45:14,023 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 18:45:14,039 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 18:45:14,047 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 18:45:14,051 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 18:45:14,053 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 18:45:14,055 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 18:45:14,056 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 18:45:14,061 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 18:45:14,061 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 18:45:14,061 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 18:45:14,063 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 18:45:14,067 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 18:45:14,068 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 18:45:14,069 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 18:45:14,069 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 18:45:14,070 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 18:45:14,072 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 18:45:14,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 18:45:14,074 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 18:45:14,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 18:45:14,078 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 18:45:14,078 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 18:45:14,079 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 18:45:14,080 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 18:45:14,085 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 18:45:14,136 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 18:45:14,137 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 18:45:14,141 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 18:45:14,141 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 18:45:14,142 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 18:45:14,142 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 18:45:14,142 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 18:45:14,142 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 18:45:14,143 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 18:45:14,143 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 18:45:14,144 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 18:45:14,144 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 18:45:14,144 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 18:45:14,145 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 18:45:14,145 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 18:45:14,145 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 18:45:14,145 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 18:45:14,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 18:45:14,146 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 18:45:14,146 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 18:45:14,146 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 18:45:14,146 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 18:45:14,147 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 18:45:14,147 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 18:45:14,147 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 18:45:14,147 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 18:45:14,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 18:45:14,635 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 18:45:14,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 18:45:14,640 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 18:45:14,641 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 18:45:14,645 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec27_product13.cil.c [2021-01-06 18:45:14,732 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ac0f25c90/089ef467165345cfb37aa41a04d9593a/FLAG8bb130c79 [2021-01-06 18:45:15,539 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 18:45:15,540 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product13.cil.c [2021-01-06 18:45:15,578 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ac0f25c90/089ef467165345cfb37aa41a04d9593a/FLAG8bb130c79 [2021-01-06 18:45:15,709 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ac0f25c90/089ef467165345cfb37aa41a04d9593a [2021-01-06 18:45:15,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 18:45:15,717 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 18:45:15,721 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 18:45:15,722 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 18:45:15,726 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 18:45:15,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 06:45:15" (1/1) ... [2021-01-06 18:45:15,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5188d66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:45:15, skipping insertion in model container [2021-01-06 18:45:15,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 06:45:15" (1/1) ... [2021-01-06 18:45:15,740 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 18:45:15,840 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~excep~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~cf~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_15~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_15~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_16~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_16~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_17~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_18~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_17~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_19~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_19~0,] left hand side expression in assignment: lhs: VariableLHS[~excep~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_15~1,] left hand side expression in assignment: lhs: VariableLHS[~cf~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~1,] left hand side expression in assignment: lhs: VariableLHS[~mem_16~1,] left hand side expression in assignment: lhs: VariableLHS[~cf~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~1,] left hand side expression in assignment: lhs: VariableLHS[~mem_17~1,] left hand side expression in assignment: address: IdentifierExpression[~mem_17~1,] left hand side expression in assignment: lhs: VariableLHS[~excep~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~1,] left hand side expression in assignment: lhs: VariableLHS[~mem_16~2,] left hand side expression in assignment: lhs: VariableLHS[~cf~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~2,] left hand side expression in assignment: lhs: VariableLHS[~mem_17~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~2,] left hand side expression in assignment: lhs: VariableLHS[~mem_18~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp15~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_19~1,] left hand side expression in assignment: lhs: VariableLHS[~cf~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~new~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_18~2,] left hand side expression in assignment: address: IdentifierExpression[~mem_18~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_19~2,] left hand side expression in assignment: address: IdentifierExpression[~mem_19~2,] left hand side expression in assignment: lhs: VariableLHS[~head~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_20~0,] left hand side expression in assignment: lhs: VariableLHS[~next~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_21~0,] left hand side expression in assignment: lhs: VariableLHS[~excep~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~3,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~count,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp15~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp16~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_22~0,] left hand side expression in assignment: lhs: VariableLHS[~head~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mem_23~0,] left hand side expression in assignment: lhs: VariableLHS[~excep~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp17~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~mem_24~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~2,] left hand side expression in assignment: lhs: VariableLHS[~mem_12~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_13~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_12~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~4,] left hand side expression in assignment: lhs: VariableLHS[~mem_13~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp3~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~msg~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~__utac__ad__arg1~0,] left hand side expression in assignment: lhs: VariableLHS[~__utac__ad__arg2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~client~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~email~0,] left hand side expression in assignment: lhs: VariableLHS[~queue_empty~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~queued_message~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~queued_client~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~10,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~12,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~privkey~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: lhs: VariableLHS[~pubkey~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_counter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp3~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~__ste_client_name0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_client_name1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_client_name2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~__ste_client_outbuffer0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_client_outbuffer1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_client_outbuffer2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] left hand side expression in assignment: lhs: VariableLHS[~__ste_ClientAddressBook_size0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_ClientAddressBook_size1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_ClientAddressBook_size2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~size~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_AddressBook0_Alias0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_AddressBook0_Alias1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_AddressBook0_Alias2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_AddressBook1_Alias0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_AddressBook1_Alias1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_AddressBook1_Alias2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_AddressBook2_Alias0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_AddressBook2_Alias1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_AddressBook2_Alias2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_AddressBook0_Address0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_AddressBook0_Address1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_AddressBook0_Address2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_AddressBook1_Address0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_AddressBook1_Address1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_AddressBook1_Address2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_AddressBook2_Address0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_AddressBook2_Address1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_AddressBook2_Address2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~__ste_client_autoResponse0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_client_autoResponse1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_client_autoResponse2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~__ste_client_privateKey0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_client_privateKey1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_client_privateKey2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~__ste_ClientKeyring_size0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_ClientKeyring_size1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_ClientKeyring_size2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~size~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_Keyring0_User0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_Keyring0_User1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_Keyring1_User0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_Keyring1_User1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_Keyring2_User0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_Keyring2_User1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_Keyring0_PublicKey0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_Keyring0_PublicKey1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_Keyring1_PublicKey0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_Keyring1_PublicKey1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_Keyring2_PublicKey0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_Keyring2_PublicKey1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~29,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~29,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~29,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~29,] left hand side expression in assignment: lhs: VariableLHS[~__ste_client_forwardReceiver0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_client_forwardReceiver1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_client_forwardReceiver2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~30,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~30,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~30,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~30,] left hand side expression in assignment: lhs: VariableLHS[~__ste_client_idCounter0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_client_idCounter1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_client_idCounter2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~bob~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp1~0,] left hand side expression in assignment: lhs: VariableLHS[~rjh~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp2~0,] left hand side expression in assignment: lhs: VariableLHS[~chuck~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp3~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp3~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~pubkey~1,] left hand side expression in assignment: lhs: VariableLHS[~__ste_Email_counter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~32,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~32,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~33,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~33,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~33,] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_id0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~34,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~34,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~34,] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_from0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_from1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~35,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~35,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~35,] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_to0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_to1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~36,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~36,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp3~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~36,] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_subject0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_subject1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~37,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~37,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp3~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~37,] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_body0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_body1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~38,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~38,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~38,] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_isEncrypted0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_isEncrypted1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~39,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~39,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~39,] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_encryptionKey0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_encryptionKey1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~40,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~40,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~40,] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_isSigned0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_isSigned1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~41,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~41,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~41,] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_signKey0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_signKey1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~42,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~42,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~42,] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_isSignatureVerified0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_isSignatureVerified1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~op1~0,] left hand side expression in assignment: lhs: VariableLHS[~op2~0,] left hand side expression in assignment: lhs: VariableLHS[~op3~0,] left hand side expression in assignment: lhs: VariableLHS[~op4~0,] left hand side expression in assignment: lhs: VariableLHS[~op5~0,] left hand side expression in assignment: lhs: VariableLHS[~op6~0,] left hand side expression in assignment: lhs: VariableLHS[~op7~0,] left hand side expression in assignment: lhs: VariableLHS[~op8~0,] left hand side expression in assignment: lhs: VariableLHS[~op9~0,] left hand side expression in assignment: lhs: VariableLHS[~op10~0,] left hand side expression in assignment: lhs: VariableLHS[~op11~0,] left hand side expression in assignment: lhs: VariableLHS[~splverifierCounter~0,] left hand side expression in assignment: lhs: VariableLHS[~splverifierCounter~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~op1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~op2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~op3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~op4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~op5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~1,] left hand side expression in assignment: lhs: VariableLHS[~op6~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: lhs: VariableLHS[~op7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: lhs: VariableLHS[~op8~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: lhs: VariableLHS[~op9~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~op10~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~op11~0,] [2021-01-06 18:45:16,930 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/product-lines/email_spec27_product13.cil.c[61363,61376] [2021-01-06 18:45:16,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 18:45:16,964 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~excep~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~cf~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_15~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_15~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_16~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_16~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_17~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_18~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_17~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_19~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_19~0,] left hand side expression in assignment: lhs: VariableLHS[~excep~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_15~1,] left hand side expression in assignment: lhs: VariableLHS[~cf~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~1,] left hand side expression in assignment: lhs: VariableLHS[~mem_16~1,] left hand side expression in assignment: lhs: VariableLHS[~cf~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~1,] left hand side expression in assignment: lhs: VariableLHS[~mem_17~1,] left hand side expression in assignment: address: IdentifierExpression[~mem_17~1,] left hand side expression in assignment: lhs: VariableLHS[~excep~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~1,] left hand side expression in assignment: lhs: VariableLHS[~mem_16~2,] left hand side expression in assignment: lhs: VariableLHS[~cf~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~2,] left hand side expression in assignment: lhs: VariableLHS[~mem_17~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~2,] left hand side expression in assignment: lhs: VariableLHS[~mem_18~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp15~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_19~1,] left hand side expression in assignment: lhs: VariableLHS[~cf~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~new~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_18~2,] left hand side expression in assignment: address: IdentifierExpression[~mem_18~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_19~2,] left hand side expression in assignment: address: IdentifierExpression[~mem_19~2,] left hand side expression in assignment: lhs: VariableLHS[~head~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_20~0,] left hand side expression in assignment: lhs: VariableLHS[~next~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_21~0,] left hand side expression in assignment: lhs: VariableLHS[~excep~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~3,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~count,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp15~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp16~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_22~0,] left hand side expression in assignment: lhs: VariableLHS[~head~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mem_23~0,] left hand side expression in assignment: lhs: VariableLHS[~excep~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp17~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~mem_24~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~2,] left hand side expression in assignment: lhs: VariableLHS[~mem_12~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_13~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_12~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~4,] left hand side expression in assignment: lhs: VariableLHS[~mem_13~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp3~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~msg~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~__utac__ad__arg1~0,] left hand side expression in assignment: lhs: VariableLHS[~__utac__ad__arg2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~client~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~email~0,] left hand side expression in assignment: lhs: VariableLHS[~queue_empty~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~queued_message~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~queued_client~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~10,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~12,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~privkey~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: lhs: VariableLHS[~pubkey~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_counter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp3~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~__ste_client_name0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_client_name1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_client_name2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~__ste_client_outbuffer0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_client_outbuffer1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_client_outbuffer2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] left hand side expression in assignment: lhs: VariableLHS[~__ste_ClientAddressBook_size0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_ClientAddressBook_size1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_ClientAddressBook_size2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~size~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_AddressBook0_Alias0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_AddressBook0_Alias1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_AddressBook0_Alias2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_AddressBook1_Alias0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_AddressBook1_Alias1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_AddressBook1_Alias2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_AddressBook2_Alias0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_AddressBook2_Alias1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_AddressBook2_Alias2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_AddressBook0_Address0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_AddressBook0_Address1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_AddressBook0_Address2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_AddressBook1_Address0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_AddressBook1_Address1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_AddressBook1_Address2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_AddressBook2_Address0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_AddressBook2_Address1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_AddressBook2_Address2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~__ste_client_autoResponse0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_client_autoResponse1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_client_autoResponse2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~__ste_client_privateKey0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_client_privateKey1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_client_privateKey2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~__ste_ClientKeyring_size0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_ClientKeyring_size1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_ClientKeyring_size2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~size~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_Keyring0_User0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_Keyring0_User1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_Keyring1_User0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_Keyring1_User1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_Keyring2_User0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_Keyring2_User1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_Keyring0_PublicKey0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_Keyring0_PublicKey1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_Keyring1_PublicKey0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_Keyring1_PublicKey1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_Keyring2_PublicKey0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_Client_Keyring2_PublicKey1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~29,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~29,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~29,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~29,] left hand side expression in assignment: lhs: VariableLHS[~__ste_client_forwardReceiver0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_client_forwardReceiver1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_client_forwardReceiver2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~30,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~30,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~30,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~30,] left hand side expression in assignment: lhs: VariableLHS[~__ste_client_idCounter0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_client_idCounter1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_client_idCounter2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~bob~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp1~0,] left hand side expression in assignment: lhs: VariableLHS[~rjh~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp2~0,] left hand side expression in assignment: lhs: VariableLHS[~chuck~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp3~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp3~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~pubkey~1,] left hand side expression in assignment: lhs: VariableLHS[~__ste_Email_counter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~32,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~32,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~33,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~33,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~33,] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_id0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~34,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~34,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~34,] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_from0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_from1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~35,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~35,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~35,] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_to0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_to1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~36,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~36,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp3~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~36,] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_subject0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_subject1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~37,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~37,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp3~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~37,] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_body0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_body1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~38,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~38,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~38,] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_isEncrypted0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_isEncrypted1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~39,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~39,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~39,] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_encryptionKey0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_encryptionKey1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~40,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~40,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~40,] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_isSigned0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_isSigned1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~41,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~41,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~41,] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_signKey0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_signKey1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~42,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~42,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~42,] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_isSignatureVerified0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__ste_email_isSignatureVerified1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~op1~0,] left hand side expression in assignment: lhs: VariableLHS[~op2~0,] left hand side expression in assignment: lhs: VariableLHS[~op3~0,] left hand side expression in assignment: lhs: VariableLHS[~op4~0,] left hand side expression in assignment: lhs: VariableLHS[~op5~0,] left hand side expression in assignment: lhs: VariableLHS[~op6~0,] left hand side expression in assignment: lhs: VariableLHS[~op7~0,] left hand side expression in assignment: lhs: VariableLHS[~op8~0,] left hand side expression in assignment: lhs: VariableLHS[~op9~0,] left hand side expression in assignment: lhs: VariableLHS[~op10~0,] left hand side expression in assignment: lhs: VariableLHS[~op11~0,] left hand side expression in assignment: lhs: VariableLHS[~splverifierCounter~0,] left hand side expression in assignment: lhs: VariableLHS[~splverifierCounter~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~op1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~op2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~op3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~op4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~op5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~1,] left hand side expression in assignment: lhs: VariableLHS[~op6~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: lhs: VariableLHS[~op7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: lhs: VariableLHS[~op8~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: lhs: VariableLHS[~op9~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~op10~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~op11~0,] [2021-01-06 18:45:17,097 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/product-lines/email_spec27_product13.cil.c[61363,61376] [2021-01-06 18:45:17,097 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 18:45:17,191 INFO L208 MainTranslator]: Completed translation [2021-01-06 18:45:17,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:45:17 WrapperNode [2021-01-06 18:45:17,192 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 18:45:17,194 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 18:45:17,194 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 18:45:17,194 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 18:45:17,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:45:17" (1/1) ... [2021-01-06 18:45:17,234 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:45:17" (1/1) ... [2021-01-06 18:45:17,327 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 18:45:17,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 18:45:17,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 18:45:17,329 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 18:45:17,349 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:45:17" (1/1) ... [2021-01-06 18:45:17,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:45:17" (1/1) ... [2021-01-06 18:45:17,371 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:45:17" (1/1) ... [2021-01-06 18:45:17,371 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:45:17" (1/1) ... [2021-01-06 18:45:17,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:45:17" (1/1) ... [2021-01-06 18:45:17,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:45:17" (1/1) ... [2021-01-06 18:45:17,471 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:45:17" (1/1) ... [2021-01-06 18:45:17,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 18:45:17,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 18:45:17,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 18:45:17,485 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 18:45:17,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:45:17" (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 18:45:17,603 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2021-01-06 18:45:17,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 18:45:17,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 18:45:17,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 18:45:17,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 18:45:19,666 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 18:45:19,666 INFO L299 CfgBuilder]: Removed 239 assume(true) statements. [2021-01-06 18:45:19,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 06:45:19 BoogieIcfgContainer [2021-01-06 18:45:19,669 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 18:45:19,671 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 18:45:19,671 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 18:45:19,675 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 18:45:19,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 06:45:15" (1/3) ... [2021-01-06 18:45:19,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@720cc513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 06:45:19, skipping insertion in model container [2021-01-06 18:45:19,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:45:17" (2/3) ... [2021-01-06 18:45:19,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@720cc513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 06:45:19, skipping insertion in model container [2021-01-06 18:45:19,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 06:45:19" (3/3) ... [2021-01-06 18:45:19,679 INFO L111 eAbstractionObserver]: Analyzing ICFG email_spec27_product13.cil.c [2021-01-06 18:45:19,685 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 18:45:19,691 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-01-06 18:45:19,712 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-01-06 18:45:19,743 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 18:45:19,743 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 18:45:19,743 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 18:45:19,743 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 18:45:19,743 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 18:45:19,744 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 18:45:19,744 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 18:45:19,744 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 18:45:19,771 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states. [2021-01-06 18:45:19,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-01-06 18:45:19,786 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:45:19,787 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:45:19,788 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:45:19,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:45:19,795 INFO L82 PathProgramCache]: Analyzing trace with hash -194309687, now seen corresponding path program 1 times [2021-01-06 18:45:19,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:45:19,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343592214] [2021-01-06 18:45:19,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:45:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:45:20,323 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 18:45:20,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343592214] [2021-01-06 18:45:20,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:45:20,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:45:20,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201171974] [2021-01-06 18:45:20,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:45:20,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:45:20,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:45:20,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:45:20,349 INFO L87 Difference]: Start difference. First operand 401 states. Second operand 3 states. [2021-01-06 18:45:20,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:45:20,533 INFO L93 Difference]: Finished difference Result 1168 states and 2063 transitions. [2021-01-06 18:45:20,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 18:45:20,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2021-01-06 18:45:20,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:45:20,560 INFO L225 Difference]: With dead ends: 1168 [2021-01-06 18:45:20,560 INFO L226 Difference]: Without dead ends: 772 [2021-01-06 18:45:20,567 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 18:45:20,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2021-01-06 18:45:20,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 395. [2021-01-06 18:45:20,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2021-01-06 18:45:20,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 691 transitions. [2021-01-06 18:45:20,656 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 691 transitions. Word has length 48 [2021-01-06 18:45:20,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:45:20,657 INFO L481 AbstractCegarLoop]: Abstraction has 395 states and 691 transitions. [2021-01-06 18:45:20,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 18:45:20,657 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 691 transitions. [2021-01-06 18:45:20,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-01-06 18:45:20,661 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:45:20,662 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:45:20,662 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 18:45:20,662 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:45:20,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:45:20,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1702143685, now seen corresponding path program 1 times [2021-01-06 18:45:20,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:45:20,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312798046] [2021-01-06 18:45:20,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:45:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:45:20,779 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 18:45:20,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312798046] [2021-01-06 18:45:20,779 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:45:20,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:45:20,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653979855] [2021-01-06 18:45:20,782 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:45:20,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:45:20,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:45:20,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:45:20,783 INFO L87 Difference]: Start difference. First operand 395 states and 691 transitions. Second operand 5 states. [2021-01-06 18:45:21,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:45:21,031 INFO L93 Difference]: Finished difference Result 1134 states and 1989 transitions. [2021-01-06 18:45:21,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 18:45:21,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2021-01-06 18:45:21,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:45:21,052 INFO L225 Difference]: With dead ends: 1134 [2021-01-06 18:45:21,053 INFO L226 Difference]: Without dead ends: 758 [2021-01-06 18:45:21,064 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 18:45:21,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2021-01-06 18:45:21,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 395. [2021-01-06 18:45:21,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2021-01-06 18:45:21,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 690 transitions. [2021-01-06 18:45:21,159 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 690 transitions. Word has length 50 [2021-01-06 18:45:21,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:45:21,160 INFO L481 AbstractCegarLoop]: Abstraction has 395 states and 690 transitions. [2021-01-06 18:45:21,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:45:21,161 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 690 transitions. [2021-01-06 18:45:21,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 18:45:21,169 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:45:21,169 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:45:21,170 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 18:45:21,170 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:45:21,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:45:21,173 INFO L82 PathProgramCache]: Analyzing trace with hash 182544200, now seen corresponding path program 1 times [2021-01-06 18:45:21,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:45:21,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057200553] [2021-01-06 18:45:21,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:45:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:45:21,295 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 18:45:21,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057200553] [2021-01-06 18:45:21,296 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:45:21,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:45:21,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742974452] [2021-01-06 18:45:21,297 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:45:21,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:45:21,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:45:21,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:45:21,299 INFO L87 Difference]: Start difference. First operand 395 states and 690 transitions. Second operand 3 states. [2021-01-06 18:45:21,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:45:21,348 INFO L93 Difference]: Finished difference Result 772 states and 1354 transitions. [2021-01-06 18:45:21,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 18:45:21,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2021-01-06 18:45:21,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:45:21,352 INFO L225 Difference]: With dead ends: 772 [2021-01-06 18:45:21,352 INFO L226 Difference]: Without dead ends: 400 [2021-01-06 18:45:21,355 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 18:45:21,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2021-01-06 18:45:21,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 395. [2021-01-06 18:45:21,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2021-01-06 18:45:21,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 689 transitions. [2021-01-06 18:45:21,383 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 689 transitions. Word has length 51 [2021-01-06 18:45:21,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:45:21,383 INFO L481 AbstractCegarLoop]: Abstraction has 395 states and 689 transitions. [2021-01-06 18:45:21,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 18:45:21,384 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 689 transitions. [2021-01-06 18:45:21,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 18:45:21,386 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:45:21,386 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:45:21,386 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 18:45:21,386 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:45:21,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:45:21,387 INFO L82 PathProgramCache]: Analyzing trace with hash -379903346, now seen corresponding path program 1 times [2021-01-06 18:45:21,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:45:21,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476093438] [2021-01-06 18:45:21,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:45:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:45:21,480 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 18:45:21,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476093438] [2021-01-06 18:45:21,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:45:21,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:45:21,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406441676] [2021-01-06 18:45:21,482 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:45:21,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:45:21,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:45:21,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:45:21,483 INFO L87 Difference]: Start difference. First operand 395 states and 689 transitions. Second operand 3 states. [2021-01-06 18:45:21,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:45:21,534 INFO L93 Difference]: Finished difference Result 782 states and 1367 transitions. [2021-01-06 18:45:21,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 18:45:21,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2021-01-06 18:45:21,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:45:21,537 INFO L225 Difference]: With dead ends: 782 [2021-01-06 18:45:21,538 INFO L226 Difference]: Without dead ends: 395 [2021-01-06 18:45:21,539 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 18:45:21,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2021-01-06 18:45:21,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2021-01-06 18:45:21,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2021-01-06 18:45:21,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 687 transitions. [2021-01-06 18:45:21,560 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 687 transitions. Word has length 52 [2021-01-06 18:45:21,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:45:21,561 INFO L481 AbstractCegarLoop]: Abstraction has 395 states and 687 transitions. [2021-01-06 18:45:21,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 18:45:21,561 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 687 transitions. [2021-01-06 18:45:21,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-01-06 18:45:21,563 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:45:21,563 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:45:21,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 18:45:21,564 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:45:21,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:45:21,564 INFO L82 PathProgramCache]: Analyzing trace with hash 525658595, now seen corresponding path program 1 times [2021-01-06 18:45:21,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:45:21,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319035911] [2021-01-06 18:45:21,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:45:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:45:21,652 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 18:45:21,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319035911] [2021-01-06 18:45:21,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:45:21,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:45:21,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75600183] [2021-01-06 18:45:21,654 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:45:21,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:45:21,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:45:21,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:45:21,656 INFO L87 Difference]: Start difference. First operand 395 states and 687 transitions. Second operand 5 states. [2021-01-06 18:45:21,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:45:21,871 INFO L93 Difference]: Finished difference Result 1124 states and 1969 transitions. [2021-01-06 18:45:21,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:45:21,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2021-01-06 18:45:21,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:45:21,878 INFO L225 Difference]: With dead ends: 1124 [2021-01-06 18:45:21,878 INFO L226 Difference]: Without dead ends: 756 [2021-01-06 18:45:21,880 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 18:45:21,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2021-01-06 18:45:21,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 395. [2021-01-06 18:45:21,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2021-01-06 18:45:21,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 686 transitions. [2021-01-06 18:45:21,909 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 686 transitions. Word has length 53 [2021-01-06 18:45:21,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:45:21,909 INFO L481 AbstractCegarLoop]: Abstraction has 395 states and 686 transitions. [2021-01-06 18:45:21,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:45:21,909 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 686 transitions. [2021-01-06 18:45:21,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-06 18:45:21,911 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:45:21,911 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:45:21,912 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 18:45:21,912 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:45:21,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:45:21,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1855605702, now seen corresponding path program 1 times [2021-01-06 18:45:21,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:45:21,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727472668] [2021-01-06 18:45:21,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:45:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:45:22,000 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 18:45:22,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727472668] [2021-01-06 18:45:22,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:45:22,001 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:45:22,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3018653] [2021-01-06 18:45:22,002 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:45:22,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:45:22,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:45:22,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:45:22,004 INFO L87 Difference]: Start difference. First operand 395 states and 686 transitions. Second operand 5 states. [2021-01-06 18:45:22,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:45:22,218 INFO L93 Difference]: Finished difference Result 1129 states and 1974 transitions. [2021-01-06 18:45:22,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:45:22,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2021-01-06 18:45:22,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:45:22,224 INFO L225 Difference]: With dead ends: 1129 [2021-01-06 18:45:22,224 INFO L226 Difference]: Without dead ends: 761 [2021-01-06 18:45:22,225 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 18:45:22,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2021-01-06 18:45:22,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 395. [2021-01-06 18:45:22,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2021-01-06 18:45:22,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 685 transitions. [2021-01-06 18:45:22,259 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 685 transitions. Word has length 54 [2021-01-06 18:45:22,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:45:22,259 INFO L481 AbstractCegarLoop]: Abstraction has 395 states and 685 transitions. [2021-01-06 18:45:22,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:45:22,259 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 685 transitions. [2021-01-06 18:45:22,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-01-06 18:45:22,261 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:45:22,261 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:45:22,261 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 18:45:22,262 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:45:22,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:45:22,268 INFO L82 PathProgramCache]: Analyzing trace with hash 966785758, now seen corresponding path program 1 times [2021-01-06 18:45:22,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:45:22,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546772873] [2021-01-06 18:45:22,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:45:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:45:22,386 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 18:45:22,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546772873] [2021-01-06 18:45:22,388 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:45:22,388 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:45:22,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96345244] [2021-01-06 18:45:22,389 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:45:22,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:45:22,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:45:22,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:45:22,401 INFO L87 Difference]: Start difference. First operand 395 states and 685 transitions. Second operand 3 states. [2021-01-06 18:45:22,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:45:22,435 INFO L93 Difference]: Finished difference Result 556 states and 953 transitions. [2021-01-06 18:45:22,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 18:45:22,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2021-01-06 18:45:22,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:45:22,439 INFO L225 Difference]: With dead ends: 556 [2021-01-06 18:45:22,440 INFO L226 Difference]: Without dead ends: 398 [2021-01-06 18:45:22,442 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 18:45:22,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-01-06 18:45:22,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 397. [2021-01-06 18:45:22,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2021-01-06 18:45:22,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 687 transitions. [2021-01-06 18:45:22,471 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 687 transitions. Word has length 55 [2021-01-06 18:45:22,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:45:22,474 INFO L481 AbstractCegarLoop]: Abstraction has 397 states and 687 transitions. [2021-01-06 18:45:22,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 18:45:22,474 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 687 transitions. [2021-01-06 18:45:22,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-06 18:45:22,476 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:45:22,476 INFO L422 BasicCegarLoop]: trace histogram [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 18:45:22,476 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 18:45:22,477 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:45:22,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:45:22,477 INFO L82 PathProgramCache]: Analyzing trace with hash 137653724, now seen corresponding path program 1 times [2021-01-06 18:45:22,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:45:22,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019089897] [2021-01-06 18:45:22,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:45:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:45:22,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:45:22,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019089897] [2021-01-06 18:45:22,592 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:45:22,592 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:45:22,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141337877] [2021-01-06 18:45:22,594 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:45:22,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:45:22,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:45:22,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:45:22,596 INFO L87 Difference]: Start difference. First operand 397 states and 687 transitions. Second operand 3 states. [2021-01-06 18:45:22,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:45:22,671 INFO L93 Difference]: Finished difference Result 1077 states and 1885 transitions. [2021-01-06 18:45:22,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 18:45:22,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2021-01-06 18:45:22,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:45:22,677 INFO L225 Difference]: With dead ends: 1077 [2021-01-06 18:45:22,678 INFO L226 Difference]: Without dead ends: 711 [2021-01-06 18:45:22,680 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 18:45:22,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2021-01-06 18:45:22,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 553. [2021-01-06 18:45:22,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2021-01-06 18:45:22,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 973 transitions. [2021-01-06 18:45:22,726 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 973 transitions. Word has length 61 [2021-01-06 18:45:22,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:45:22,726 INFO L481 AbstractCegarLoop]: Abstraction has 553 states and 973 transitions. [2021-01-06 18:45:22,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 18:45:22,726 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 973 transitions. [2021-01-06 18:45:22,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-01-06 18:45:22,728 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:45:22,728 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 18:45:22,731 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 18:45:22,731 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:45:22,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:45:22,732 INFO L82 PathProgramCache]: Analyzing trace with hash -193202821, now seen corresponding path program 1 times [2021-01-06 18:45:22,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:45:22,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559045120] [2021-01-06 18:45:22,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:45:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:45:22,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:45:22,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559045120] [2021-01-06 18:45:22,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089995916] [2021-01-06 18:45:22,851 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 18:45:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:45:23,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 907 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 18:45:23,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 18:45:23,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:45:23,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 18:45:23,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-01-06 18:45:23,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6436216] [2021-01-06 18:45:23,453 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:45:23,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:45:23,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:45:23,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:45:23,457 INFO L87 Difference]: Start difference. First operand 553 states and 973 transitions. Second operand 5 states. [2021-01-06 18:45:23,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:45:23,545 INFO L93 Difference]: Finished difference Result 1081 states and 1888 transitions. [2021-01-06 18:45:23,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 18:45:23,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2021-01-06 18:45:23,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:45:23,552 INFO L225 Difference]: With dead ends: 1081 [2021-01-06 18:45:23,552 INFO L226 Difference]: Without dead ends: 923 [2021-01-06 18:45:23,553 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 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 18:45:23,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2021-01-06 18:45:23,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 763. [2021-01-06 18:45:23,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2021-01-06 18:45:23,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1356 transitions. [2021-01-06 18:45:23,617 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1356 transitions. Word has length 62 [2021-01-06 18:45:23,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:45:23,617 INFO L481 AbstractCegarLoop]: Abstraction has 763 states and 1356 transitions. [2021-01-06 18:45:23,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:45:23,617 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1356 transitions. [2021-01-06 18:45:23,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 18:45:23,619 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:45:23,619 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:45:23,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-01-06 18:45:23,835 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:45:23,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:45:23,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1215668562, now seen corresponding path program 1 times [2021-01-06 18:45:23,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:45:23,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000719724] [2021-01-06 18:45:23,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:45:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:45:23,925 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 18:45:23,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000719724] [2021-01-06 18:45:23,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:45:23,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:45:23,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559859367] [2021-01-06 18:45:23,927 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:45:23,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:45:23,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:45:23,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:45:23,931 INFO L87 Difference]: Start difference. First operand 763 states and 1356 transitions. Second operand 3 states. [2021-01-06 18:45:24,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:45:24,036 INFO L93 Difference]: Finished difference Result 1959 states and 3499 transitions. [2021-01-06 18:45:24,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 18:45:24,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2021-01-06 18:45:24,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:45:24,045 INFO L225 Difference]: With dead ends: 1959 [2021-01-06 18:45:24,045 INFO L226 Difference]: Without dead ends: 1285 [2021-01-06 18:45:24,047 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 18:45:24,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2021-01-06 18:45:24,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1127. [2021-01-06 18:45:24,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1127 states. [2021-01-06 18:45:24,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 2020 transitions. [2021-01-06 18:45:24,121 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 2020 transitions. Word has length 68 [2021-01-06 18:45:24,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:45:24,122 INFO L481 AbstractCegarLoop]: Abstraction has 1127 states and 2020 transitions. [2021-01-06 18:45:24,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 18:45:24,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 2020 transitions. [2021-01-06 18:45:24,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-06 18:45:24,128 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:45:24,129 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 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] [2021-01-06 18:45:24,129 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 18:45:24,129 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:45:24,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:45:24,130 INFO L82 PathProgramCache]: Analyzing trace with hash -131383234, now seen corresponding path program 2 times [2021-01-06 18:45:24,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:45:24,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728844676] [2021-01-06 18:45:24,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:45:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:45:24,255 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:45:24,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728844676] [2021-01-06 18:45:24,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:45:24,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:45:24,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647958685] [2021-01-06 18:45:24,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:45:24,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:45:24,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:45:24,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:45:24,258 INFO L87 Difference]: Start difference. First operand 1127 states and 2020 transitions. Second operand 5 states. [2021-01-06 18:45:24,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:45:24,385 INFO L93 Difference]: Finished difference Result 2169 states and 3880 transitions. [2021-01-06 18:45:24,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:45:24,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2021-01-06 18:45:24,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:45:24,395 INFO L225 Difference]: With dead ends: 2169 [2021-01-06 18:45:24,395 INFO L226 Difference]: Without dead ends: 1285 [2021-01-06 18:45:24,399 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 18:45:24,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2021-01-06 18:45:24,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1127. [2021-01-06 18:45:24,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1127 states. [2021-01-06 18:45:24,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 2018 transitions. [2021-01-06 18:45:24,473 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 2018 transitions. Word has length 69 [2021-01-06 18:45:24,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:45:24,474 INFO L481 AbstractCegarLoop]: Abstraction has 1127 states and 2018 transitions. [2021-01-06 18:45:24,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:45:24,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 2018 transitions. [2021-01-06 18:45:24,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-06 18:45:24,479 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:45:24,480 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:45:24,480 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 18:45:24,480 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:45:24,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:45:24,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1121988477, now seen corresponding path program 1 times [2021-01-06 18:45:24,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:45:24,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605869895] [2021-01-06 18:45:24,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:45:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:45:24,561 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 18:45:24,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605869895] [2021-01-06 18:45:24,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:45:24,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:45:24,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443561423] [2021-01-06 18:45:24,564 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:45:24,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:45:24,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:45:24,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:45:24,565 INFO L87 Difference]: Start difference. First operand 1127 states and 2018 transitions. Second operand 3 states. [2021-01-06 18:45:24,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:45:24,697 INFO L93 Difference]: Finished difference Result 3023 states and 5440 transitions. [2021-01-06 18:45:24,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 18:45:24,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2021-01-06 18:45:24,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:45:24,710 INFO L225 Difference]: With dead ends: 3023 [2021-01-06 18:45:24,710 INFO L226 Difference]: Without dead ends: 1993 [2021-01-06 18:45:24,713 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 18:45:24,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2021-01-06 18:45:24,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1835. [2021-01-06 18:45:24,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1835 states. [2021-01-06 18:45:24,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 3309 transitions. [2021-01-06 18:45:24,853 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 3309 transitions. Word has length 69 [2021-01-06 18:45:24,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:45:24,855 INFO L481 AbstractCegarLoop]: Abstraction has 1835 states and 3309 transitions. [2021-01-06 18:45:24,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 18:45:24,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 3309 transitions. [2021-01-06 18:45:24,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-06 18:45:24,859 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:45:24,859 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:45:24,859 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 18:45:24,859 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:45:24,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:45:24,860 INFO L82 PathProgramCache]: Analyzing trace with hash 910355568, now seen corresponding path program 1 times [2021-01-06 18:45:24,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:45:24,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477721494] [2021-01-06 18:45:24,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:45:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:45:24,936 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 18:45:24,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477721494] [2021-01-06 18:45:24,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:45:24,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:45:24,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899177272] [2021-01-06 18:45:24,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:45:24,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:45:24,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:45:24,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:45:24,944 INFO L87 Difference]: Start difference. First operand 1835 states and 3309 transitions. Second operand 3 states. [2021-01-06 18:45:25,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:45:25,139 INFO L93 Difference]: Finished difference Result 4883 states and 8832 transitions. [2021-01-06 18:45:25,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 18:45:25,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2021-01-06 18:45:25,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:45:25,158 INFO L225 Difference]: With dead ends: 4883 [2021-01-06 18:45:25,159 INFO L226 Difference]: Without dead ends: 3179 [2021-01-06 18:45:25,163 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 18:45:25,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2021-01-06 18:45:25,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 3021. [2021-01-06 18:45:25,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3021 states. [2021-01-06 18:45:25,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3021 states to 3021 states and 5466 transitions. [2021-01-06 18:45:25,423 INFO L78 Accepts]: Start accepts. Automaton has 3021 states and 5466 transitions. Word has length 70 [2021-01-06 18:45:25,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:45:25,423 INFO L481 AbstractCegarLoop]: Abstraction has 3021 states and 5466 transitions. [2021-01-06 18:45:25,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 18:45:25,423 INFO L276 IsEmpty]: Start isEmpty. Operand 3021 states and 5466 transitions. [2021-01-06 18:45:25,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-01-06 18:45:25,429 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:45:25,429 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:45:25,429 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 18:45:25,429 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:45:25,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:45:25,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1352445838, now seen corresponding path program 1 times [2021-01-06 18:45:25,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:45:25,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934447922] [2021-01-06 18:45:25,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:45:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:45:25,509 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 18:45:25,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934447922] [2021-01-06 18:45:25,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:45:25,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:45:25,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735881709] [2021-01-06 18:45:25,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:45:25,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:45:25,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:45:25,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:45:25,513 INFO L87 Difference]: Start difference. First operand 3021 states and 5466 transitions. Second operand 3 states. [2021-01-06 18:45:25,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:45:25,834 INFO L93 Difference]: Finished difference Result 8157 states and 14786 transitions. [2021-01-06 18:45:25,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 18:45:25,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2021-01-06 18:45:25,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:45:25,869 INFO L225 Difference]: With dead ends: 8157 [2021-01-06 18:45:25,869 INFO L226 Difference]: Without dead ends: 5301 [2021-01-06 18:45:25,875 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 18:45:25,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5301 states. [2021-01-06 18:45:26,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5301 to 5143. [2021-01-06 18:45:26,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5143 states. [2021-01-06 18:45:26,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5143 states to 5143 states and 9315 transitions. [2021-01-06 18:45:26,251 INFO L78 Accepts]: Start accepts. Automaton has 5143 states and 9315 transitions. Word has length 71 [2021-01-06 18:45:26,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:45:26,251 INFO L481 AbstractCegarLoop]: Abstraction has 5143 states and 9315 transitions. [2021-01-06 18:45:26,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 18:45:26,252 INFO L276 IsEmpty]: Start isEmpty. Operand 5143 states and 9315 transitions. [2021-01-06 18:45:26,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 18:45:26,261 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:45:26,261 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2021-01-06 18:45:26,261 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 18:45:26,261 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:45:26,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:45:26,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1058303086, now seen corresponding path program 1 times [2021-01-06 18:45:26,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:45:26,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754674448] [2021-01-06 18:45:26,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:45:26,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:45:26,345 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-06 18:45:26,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754674448] [2021-01-06 18:45:26,345 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:45:26,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:45:26,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718589688] [2021-01-06 18:45:26,347 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:45:26,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:45:26,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:45:26,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:45:26,348 INFO L87 Difference]: Start difference. First operand 5143 states and 9315 transitions. Second operand 5 states. [2021-01-06 18:45:27,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:45:27,114 INFO L93 Difference]: Finished difference Result 14656 states and 26576 transitions. [2021-01-06 18:45:27,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 18:45:27,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2021-01-06 18:45:27,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:45:27,184 INFO L225 Difference]: With dead ends: 14656 [2021-01-06 18:45:27,184 INFO L226 Difference]: Without dead ends: 9756 [2021-01-06 18:45:27,198 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 18:45:27,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9756 states. [2021-01-06 18:45:27,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9756 to 5143. [2021-01-06 18:45:27,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5143 states. [2021-01-06 18:45:27,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5143 states to 5143 states and 9265 transitions. [2021-01-06 18:45:27,747 INFO L78 Accepts]: Start accepts. Automaton has 5143 states and 9265 transitions. Word has length 72 [2021-01-06 18:45:27,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:45:27,747 INFO L481 AbstractCegarLoop]: Abstraction has 5143 states and 9265 transitions. [2021-01-06 18:45:27,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:45:27,747 INFO L276 IsEmpty]: Start isEmpty. Operand 5143 states and 9265 transitions. [2021-01-06 18:45:27,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 18:45:27,754 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:45:27,754 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:45:27,754 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 18:45:27,755 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:45:27,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:45:27,755 INFO L82 PathProgramCache]: Analyzing trace with hash -659289439, now seen corresponding path program 1 times [2021-01-06 18:45:27,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:45:27,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342808085] [2021-01-06 18:45:27,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:45:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:45:27,830 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 18:45:27,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342808085] [2021-01-06 18:45:27,830 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:45:27,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:45:27,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637475903] [2021-01-06 18:45:27,831 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:45:27,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:45:27,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:45:27,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:45:27,832 INFO L87 Difference]: Start difference. First operand 5143 states and 9265 transitions. Second operand 3 states. [2021-01-06 18:45:28,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:45:28,416 INFO L93 Difference]: Finished difference Result 14981 states and 27028 transitions. [2021-01-06 18:45:28,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 18:45:28,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 18:45:28,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:45:28,449 INFO L225 Difference]: With dead ends: 14981 [2021-01-06 18:45:28,449 INFO L226 Difference]: Without dead ends: 10007 [2021-01-06 18:45:28,460 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 18:45:28,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10007 states. [2021-01-06 18:45:29,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10007 to 9849. [2021-01-06 18:45:29,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9849 states. [2021-01-06 18:45:29,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9849 states to 9849 states and 17746 transitions. [2021-01-06 18:45:29,226 INFO L78 Accepts]: Start accepts. Automaton has 9849 states and 17746 transitions. Word has length 72 [2021-01-06 18:45:29,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:45:29,226 INFO L481 AbstractCegarLoop]: Abstraction has 9849 states and 17746 transitions. [2021-01-06 18:45:29,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 18:45:29,226 INFO L276 IsEmpty]: Start isEmpty. Operand 9849 states and 17746 transitions. [2021-01-06 18:45:29,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 18:45:29,235 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:45:29,235 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2021-01-06 18:45:29,235 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 18:45:29,235 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:45:29,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:45:29,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1445262707, now seen corresponding path program 1 times [2021-01-06 18:45:29,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:45:29,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316028664] [2021-01-06 18:45:29,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:45:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:45:29,312 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-06 18:45:29,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316028664] [2021-01-06 18:45:29,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:45:29,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:45:29,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144651176] [2021-01-06 18:45:29,314 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:45:29,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:45:29,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:45:29,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:45:29,315 INFO L87 Difference]: Start difference. First operand 9849 states and 17746 transitions. Second operand 4 states. [2021-01-06 18:45:29,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:45:29,863 INFO L93 Difference]: Finished difference Result 9948 states and 17909 transitions. [2021-01-06 18:45:29,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 18:45:29,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2021-01-06 18:45:29,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:45:29,894 INFO L225 Difference]: With dead ends: 9948 [2021-01-06 18:45:29,895 INFO L226 Difference]: Without dead ends: 9849 [2021-01-06 18:45:29,901 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 18:45:29,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9849 states. [2021-01-06 18:45:30,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9849 to 9849. [2021-01-06 18:45:30,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9849 states. [2021-01-06 18:45:30,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9849 states to 9849 states and 17744 transitions. [2021-01-06 18:45:30,769 INFO L78 Accepts]: Start accepts. Automaton has 9849 states and 17744 transitions. Word has length 73 [2021-01-06 18:45:30,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:45:30,770 INFO L481 AbstractCegarLoop]: Abstraction has 9849 states and 17744 transitions. [2021-01-06 18:45:30,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:45:30,770 INFO L276 IsEmpty]: Start isEmpty. Operand 9849 states and 17744 transitions. [2021-01-06 18:45:30,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 18:45:30,780 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:45:30,780 INFO L422 BasicCegarLoop]: trace histogram [3, 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 18:45:30,781 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 18:45:30,781 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:45:30,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:45:30,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1527183405, now seen corresponding path program 1 times [2021-01-06 18:45:30,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:45:30,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284517387] [2021-01-06 18:45:30,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:45:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:45:30,913 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-06 18:45:30,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284517387] [2021-01-06 18:45:30,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:45:30,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:45:30,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262628222] [2021-01-06 18:45:30,917 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:45:30,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:45:30,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:45:30,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:45:30,920 INFO L87 Difference]: Start difference. First operand 9849 states and 17744 transitions. Second operand 5 states. [2021-01-06 18:45:31,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:45:31,569 INFO L93 Difference]: Finished difference Result 10282 states and 18450 transitions. [2021-01-06 18:45:31,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 18:45:31,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2021-01-06 18:45:31,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:45:31,600 INFO L225 Difference]: With dead ends: 10282 [2021-01-06 18:45:31,600 INFO L226 Difference]: Without dead ends: 10184 [2021-01-06 18:45:31,606 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-06 18:45:31,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10184 states. [2021-01-06 18:45:32,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10184 to 9931. [2021-01-06 18:45:32,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9931 states. [2021-01-06 18:45:32,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9931 states to 9931 states and 17877 transitions. [2021-01-06 18:45:32,227 INFO L78 Accepts]: Start accepts. Automaton has 9931 states and 17877 transitions. Word has length 76 [2021-01-06 18:45:32,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:45:32,227 INFO L481 AbstractCegarLoop]: Abstraction has 9931 states and 17877 transitions. [2021-01-06 18:45:32,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:45:32,227 INFO L276 IsEmpty]: Start isEmpty. Operand 9931 states and 17877 transitions. [2021-01-06 18:45:32,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-06 18:45:32,238 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:45:32,238 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2021-01-06 18:45:32,238 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 18:45:32,238 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:45:32,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:45:32,239 INFO L82 PathProgramCache]: Analyzing trace with hash 2095526246, now seen corresponding path program 1 times [2021-01-06 18:45:32,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:45:32,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873760120] [2021-01-06 18:45:32,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:45:32,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:45:32,372 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-06 18:45:32,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873760120] [2021-01-06 18:45:32,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:45:32,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 18:45:32,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399367858] [2021-01-06 18:45:32,374 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 18:45:32,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:45:32,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 18:45:32,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-01-06 18:45:32,375 INFO L87 Difference]: Start difference. First operand 9931 states and 17877 transitions. Second operand 9 states. [2021-01-06 18:45:33,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:45:33,078 INFO L93 Difference]: Finished difference Result 10106 states and 18159 transitions. [2021-01-06 18:45:33,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 18:45:33,079 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 77 [2021-01-06 18:45:33,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:45:33,104 INFO L225 Difference]: With dead ends: 10106 [2021-01-06 18:45:33,104 INFO L226 Difference]: Without dead ends: 9929 [2021-01-06 18:45:33,108 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=233, Unknown=0, NotChecked=0, Total=342 [2021-01-06 18:45:33,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9929 states. [2021-01-06 18:45:33,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9929 to 9911. [2021-01-06 18:45:33,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9911 states. [2021-01-06 18:45:33,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9911 states to 9911 states and 17840 transitions. [2021-01-06 18:45:33,616 INFO L78 Accepts]: Start accepts. Automaton has 9911 states and 17840 transitions. Word has length 77 [2021-01-06 18:45:33,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:45:33,616 INFO L481 AbstractCegarLoop]: Abstraction has 9911 states and 17840 transitions. [2021-01-06 18:45:33,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 18:45:33,617 INFO L276 IsEmpty]: Start isEmpty. Operand 9911 states and 17840 transitions. [2021-01-06 18:45:33,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-01-06 18:45:33,632 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:45:33,632 INFO L422 BasicCegarLoop]: trace histogram [3, 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 18:45:33,633 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 18:45:33,633 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:45:33,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:45:33,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1371924307, now seen corresponding path program 1 times [2021-01-06 18:45:33,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:45:33,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629226891] [2021-01-06 18:45:33,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:45:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:45:33,762 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-06 18:45:33,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629226891] [2021-01-06 18:45:33,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:45:33,763 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:45:33,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351421787] [2021-01-06 18:45:33,764 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:45:33,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:45:33,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:45:33,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:45:33,765 INFO L87 Difference]: Start difference. First operand 9911 states and 17840 transitions. Second operand 5 states. [2021-01-06 18:45:34,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:45:34,624 INFO L93 Difference]: Finished difference Result 10533 states and 18816 transitions. [2021-01-06 18:45:34,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 18:45:34,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2021-01-06 18:45:34,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:45:34,655 INFO L225 Difference]: With dead ends: 10533 [2021-01-06 18:45:34,655 INFO L226 Difference]: Without dead ends: 10348 [2021-01-06 18:45:34,660 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-06 18:45:34,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10348 states. [2021-01-06 18:45:35,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10348 to 10045. [2021-01-06 18:45:35,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10045 states. [2021-01-06 18:45:35,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10045 states to 10045 states and 18050 transitions. [2021-01-06 18:45:35,421 INFO L78 Accepts]: Start accepts. Automaton has 10045 states and 18050 transitions. Word has length 89 [2021-01-06 18:45:35,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:45:35,422 INFO L481 AbstractCegarLoop]: Abstraction has 10045 states and 18050 transitions. [2021-01-06 18:45:35,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:45:35,422 INFO L276 IsEmpty]: Start isEmpty. Operand 10045 states and 18050 transitions. [2021-01-06 18:45:35,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 18:45:35,439 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:45:35,439 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2021-01-06 18:45:35,440 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 18:45:35,440 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:45:35,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:45:35,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1756467449, now seen corresponding path program 1 times [2021-01-06 18:45:35,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:45:35,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181004700] [2021-01-06 18:45:35,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:45:35,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:45:35,597 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-06 18:45:35,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181004700] [2021-01-06 18:45:35,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:45:35,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 18:45:35,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728860498] [2021-01-06 18:45:35,598 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 18:45:35,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:45:35,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 18:45:35,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-01-06 18:45:35,601 INFO L87 Difference]: Start difference. First operand 10045 states and 18050 transitions. Second operand 9 states. [2021-01-06 18:45:36,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:45:36,431 INFO L93 Difference]: Finished difference Result 10349 states and 18538 transitions. [2021-01-06 18:45:36,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 18:45:36,432 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2021-01-06 18:45:36,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:45:36,463 INFO L225 Difference]: With dead ends: 10349 [2021-01-06 18:45:36,463 INFO L226 Difference]: Without dead ends: 10044 [2021-01-06 18:45:36,470 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=233, Unknown=0, NotChecked=0, Total=342 [2021-01-06 18:45:36,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10044 states. [2021-01-06 18:45:37,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10044 to 9967. [2021-01-06 18:45:37,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9967 states. [2021-01-06 18:45:37,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9967 states to 9967 states and 17919 transitions. [2021-01-06 18:45:37,136 INFO L78 Accepts]: Start accepts. Automaton has 9967 states and 17919 transitions. Word has length 90 [2021-01-06 18:45:37,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:45:37,137 INFO L481 AbstractCegarLoop]: Abstraction has 9967 states and 17919 transitions. [2021-01-06 18:45:37,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 18:45:37,137 INFO L276 IsEmpty]: Start isEmpty. Operand 9967 states and 17919 transitions. [2021-01-06 18:45:37,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-06 18:45:37,151 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:45:37,151 INFO L422 BasicCegarLoop]: trace histogram [3, 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 18:45:37,151 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 18:45:37,151 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:45:37,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:45:37,152 INFO L82 PathProgramCache]: Analyzing trace with hash 824954359, now seen corresponding path program 1 times [2021-01-06 18:45:37,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:45:37,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041245158] [2021-01-06 18:45:37,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:45:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:45:37,305 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-06 18:45:37,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041245158] [2021-01-06 18:45:37,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:45:37,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 18:45:37,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400490452] [2021-01-06 18:45:37,312 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 18:45:37,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:45:37,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 18:45:37,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-01-06 18:45:37,313 INFO L87 Difference]: Start difference. First operand 9967 states and 17919 transitions. Second operand 10 states. [2021-01-06 18:45:38,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:45:38,261 INFO L93 Difference]: Finished difference Result 10624 states and 18921 transitions. [2021-01-06 18:45:38,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 18:45:38,263 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2021-01-06 18:45:38,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:45:38,291 INFO L225 Difference]: With dead ends: 10624 [2021-01-06 18:45:38,291 INFO L226 Difference]: Without dead ends: 10446 [2021-01-06 18:45:38,297 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=292, Unknown=0, NotChecked=0, Total=420 [2021-01-06 18:45:38,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10446 states. [2021-01-06 18:45:38,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10446 to 10006. [2021-01-06 18:45:38,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10006 states. [2021-01-06 18:45:38,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10006 states to 10006 states and 17972 transitions. [2021-01-06 18:45:38,885 INFO L78 Accepts]: Start accepts. Automaton has 10006 states and 17972 transitions. Word has length 92 [2021-01-06 18:45:38,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:45:38,886 INFO L481 AbstractCegarLoop]: Abstraction has 10006 states and 17972 transitions. [2021-01-06 18:45:38,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 18:45:38,886 INFO L276 IsEmpty]: Start isEmpty. Operand 10006 states and 17972 transitions. [2021-01-06 18:45:38,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-01-06 18:45:38,899 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:45:38,900 INFO L422 BasicCegarLoop]: trace histogram [3, 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 18:45:38,900 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 18:45:38,900 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:45:38,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:45:38,901 INFO L82 PathProgramCache]: Analyzing trace with hash 678836210, now seen corresponding path program 1 times [2021-01-06 18:45:38,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:45:38,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129174772] [2021-01-06 18:45:38,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:45:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:45:39,026 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-06 18:45:39,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129174772] [2021-01-06 18:45:39,027 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:45:39,027 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 18:45:39,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030795619] [2021-01-06 18:45:39,028 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 18:45:39,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:45:39,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 18:45:39,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-01-06 18:45:39,029 INFO L87 Difference]: Start difference. First operand 10006 states and 17972 transitions. Second operand 9 states. [2021-01-06 18:45:39,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:45:39,898 INFO L93 Difference]: Finished difference Result 11177 states and 19747 transitions. [2021-01-06 18:45:39,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 18:45:39,899 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2021-01-06 18:45:39,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:45:39,922 INFO L225 Difference]: With dead ends: 11177 [2021-01-06 18:45:39,923 INFO L226 Difference]: Without dead ends: 10974 [2021-01-06 18:45:39,928 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2021-01-06 18:45:39,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10974 states. [2021-01-06 18:45:40,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10974 to 10231. [2021-01-06 18:45:40,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10231 states. [2021-01-06 18:45:40,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10231 states to 10231 states and 18313 transitions. [2021-01-06 18:45:40,635 INFO L78 Accepts]: Start accepts. Automaton has 10231 states and 18313 transitions. Word has length 93 [2021-01-06 18:45:40,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:45:40,636 INFO L481 AbstractCegarLoop]: Abstraction has 10231 states and 18313 transitions. [2021-01-06 18:45:40,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 18:45:40,636 INFO L276 IsEmpty]: Start isEmpty. Operand 10231 states and 18313 transitions. [2021-01-06 18:45:40,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-01-06 18:45:40,651 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:45:40,651 INFO L422 BasicCegarLoop]: trace histogram [3, 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 18:45:40,651 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 18:45:40,651 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:45:40,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:45:40,652 INFO L82 PathProgramCache]: Analyzing trace with hash -635527938, now seen corresponding path program 1 times [2021-01-06 18:45:40,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:45:40,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891209400] [2021-01-06 18:45:40,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:45:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:45:40,805 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-06 18:45:40,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891209400] [2021-01-06 18:45:40,805 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:45:40,805 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 18:45:40,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272996182] [2021-01-06 18:45:40,806 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 18:45:40,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:45:40,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 18:45:40,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-01-06 18:45:40,807 INFO L87 Difference]: Start difference. First operand 10231 states and 18313 transitions. Second operand 12 states. [2021-01-06 18:45:44,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:45:44,277 INFO L93 Difference]: Finished difference Result 33963 states and 59851 transitions. [2021-01-06 18:45:44,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-01-06 18:45:44,277 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2021-01-06 18:45:44,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:45:44,339 INFO L225 Difference]: With dead ends: 33963 [2021-01-06 18:45:44,339 INFO L226 Difference]: Without dead ends: 33654 [2021-01-06 18:45:44,350 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=382, Invalid=808, Unknown=0, NotChecked=0, Total=1190 [2021-01-06 18:45:44,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33654 states. [2021-01-06 18:45:45,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33654 to 20792. [2021-01-06 18:45:45,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20792 states. [2021-01-06 18:45:45,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20792 states to 20792 states and 37113 transitions. [2021-01-06 18:45:45,614 INFO L78 Accepts]: Start accepts. Automaton has 20792 states and 37113 transitions. Word has length 93 [2021-01-06 18:45:45,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:45:45,614 INFO L481 AbstractCegarLoop]: Abstraction has 20792 states and 37113 transitions. [2021-01-06 18:45:45,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 18:45:45,614 INFO L276 IsEmpty]: Start isEmpty. Operand 20792 states and 37113 transitions. [2021-01-06 18:45:45,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-01-06 18:45:45,638 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:45:45,638 INFO L422 BasicCegarLoop]: trace histogram [3, 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 18:45:45,638 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 18:45:45,639 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:45:45,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:45:45,639 INFO L82 PathProgramCache]: Analyzing trace with hash -547535786, now seen corresponding path program 1 times [2021-01-06 18:45:45,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:45:45,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414329731] [2021-01-06 18:45:45,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:45:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:45:45,744 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-06 18:45:45,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414329731] [2021-01-06 18:45:45,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:45:45,745 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 18:45:45,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980286987] [2021-01-06 18:45:45,745 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 18:45:45,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:45:45,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 18:45:45,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 18:45:45,746 INFO L87 Difference]: Start difference. First operand 20792 states and 37113 transitions. Second operand 7 states. [2021-01-06 18:45:46,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:45:46,807 INFO L93 Difference]: Finished difference Result 22044 states and 39016 transitions. [2021-01-06 18:45:46,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 18:45:46,808 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2021-01-06 18:45:46,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:45:46,835 INFO L225 Difference]: With dead ends: 22044 [2021-01-06 18:45:46,835 INFO L226 Difference]: Without dead ends: 20825 [2021-01-06 18:45:46,843 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-01-06 18:45:46,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20825 states. [2021-01-06 18:45:47,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20825 to 20650. [2021-01-06 18:45:47,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20650 states. [2021-01-06 18:45:47,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20650 states to 20650 states and 36887 transitions. [2021-01-06 18:45:47,879 INFO L78 Accepts]: Start accepts. Automaton has 20650 states and 36887 transitions. Word has length 93 [2021-01-06 18:45:47,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:45:47,880 INFO L481 AbstractCegarLoop]: Abstraction has 20650 states and 36887 transitions. [2021-01-06 18:45:47,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 18:45:47,880 INFO L276 IsEmpty]: Start isEmpty. Operand 20650 states and 36887 transitions. [2021-01-06 18:45:47,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-01-06 18:45:47,896 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:45:47,897 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2021-01-06 18:45:47,897 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 18:45:47,897 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:45:47,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:45:47,897 INFO L82 PathProgramCache]: Analyzing trace with hash -659278606, now seen corresponding path program 1 times [2021-01-06 18:45:47,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:45:47,898 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129950168] [2021-01-06 18:45:47,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:45:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:45:48,006 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-06 18:45:48,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129950168] [2021-01-06 18:45:48,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:45:48,007 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 18:45:48,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680740220] [2021-01-06 18:45:48,007 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 18:45:48,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:45:48,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 18:45:48,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 18:45:48,008 INFO L87 Difference]: Start difference. First operand 20650 states and 36887 transitions. Second operand 7 states. [2021-01-06 18:45:50,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:45:50,057 INFO L93 Difference]: Finished difference Result 27324 states and 47081 transitions. [2021-01-06 18:45:50,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 18:45:50,057 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2021-01-06 18:45:50,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:45:50,087 INFO L225 Difference]: With dead ends: 27324 [2021-01-06 18:45:50,088 INFO L226 Difference]: Without dead ends: 26581 [2021-01-06 18:45:50,094 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2021-01-06 18:45:50,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26581 states. [2021-01-06 18:45:51,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26581 to 21797. [2021-01-06 18:45:51,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21797 states. [2021-01-06 18:45:51,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21797 states to 21797 states and 38605 transitions. [2021-01-06 18:45:51,173 INFO L78 Accepts]: Start accepts. Automaton has 21797 states and 38605 transitions. Word has length 94 [2021-01-06 18:45:51,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:45:51,174 INFO L481 AbstractCegarLoop]: Abstraction has 21797 states and 38605 transitions. [2021-01-06 18:45:51,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 18:45:51,174 INFO L276 IsEmpty]: Start isEmpty. Operand 21797 states and 38605 transitions. [2021-01-06 18:45:51,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-06 18:45:51,331 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:45:51,332 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2021-01-06 18:45:51,332 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 18:45:51,332 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:45:51,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:45:51,333 INFO L82 PathProgramCache]: Analyzing trace with hash 2054331346, now seen corresponding path program 1 times [2021-01-06 18:45:51,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:45:51,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557305887] [2021-01-06 18:45:51,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:45:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:45:51,402 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-06 18:45:51,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557305887] [2021-01-06 18:45:51,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:45:51,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:45:51,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398308146] [2021-01-06 18:45:51,403 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:45:51,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:45:51,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:45:51,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:45:51,404 INFO L87 Difference]: Start difference. First operand 21797 states and 38605 transitions. Second operand 4 states. [2021-01-06 18:45:52,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:45:52,530 INFO L93 Difference]: Finished difference Result 24235 states and 42294 transitions. [2021-01-06 18:45:52,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:45:52,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2021-01-06 18:45:52,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:45:52,560 INFO L225 Difference]: With dead ends: 24235 [2021-01-06 18:45:52,560 INFO L226 Difference]: Without dead ends: 22842 [2021-01-06 18:45:52,567 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 18:45:52,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22842 states. [2021-01-06 18:45:53,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22842 to 21829. [2021-01-06 18:45:53,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21829 states. [2021-01-06 18:45:53,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21829 states to 21829 states and 38637 transitions. [2021-01-06 18:45:53,937 INFO L78 Accepts]: Start accepts. Automaton has 21829 states and 38637 transitions. Word has length 95 [2021-01-06 18:45:53,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:45:53,938 INFO L481 AbstractCegarLoop]: Abstraction has 21829 states and 38637 transitions. [2021-01-06 18:45:53,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:45:53,938 INFO L276 IsEmpty]: Start isEmpty. Operand 21829 states and 38637 transitions. [2021-01-06 18:45:53,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-06 18:45:53,962 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:45:53,962 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2021-01-06 18:45:53,962 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 18:45:53,962 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:45:53,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:45:53,963 INFO L82 PathProgramCache]: Analyzing trace with hash 774467668, now seen corresponding path program 1 times [2021-01-06 18:45:53,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:45:53,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897970698] [2021-01-06 18:45:53,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:45:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:45:54,110 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-06 18:45:54,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897970698] [2021-01-06 18:45:54,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:45:54,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 18:45:54,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346164710] [2021-01-06 18:45:54,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 18:45:54,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:45:54,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 18:45:54,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-01-06 18:45:54,112 INFO L87 Difference]: Start difference. First operand 21829 states and 38637 transitions. Second operand 11 states. [2021-01-06 18:45:55,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:45:55,899 INFO L93 Difference]: Finished difference Result 23181 states and 40667 transitions. [2021-01-06 18:45:55,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 18:45:55,900 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2021-01-06 18:45:55,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:45:55,926 INFO L225 Difference]: With dead ends: 23181 [2021-01-06 18:45:55,926 INFO L226 Difference]: Without dead ends: 22570 [2021-01-06 18:45:55,931 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2021-01-06 18:45:55,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22570 states. [2021-01-06 18:45:56,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22570 to 21962. [2021-01-06 18:45:56,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21962 states. [2021-01-06 18:45:57,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21962 states to 21962 states and 38827 transitions. [2021-01-06 18:45:57,028 INFO L78 Accepts]: Start accepts. Automaton has 21962 states and 38827 transitions. Word has length 95 [2021-01-06 18:45:57,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:45:57,028 INFO L481 AbstractCegarLoop]: Abstraction has 21962 states and 38827 transitions. [2021-01-06 18:45:57,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 18:45:57,028 INFO L276 IsEmpty]: Start isEmpty. Operand 21962 states and 38827 transitions. [2021-01-06 18:45:57,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 18:45:57,052 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:45:57,053 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2021-01-06 18:45:57,053 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 18:45:57,053 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:45:57,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:45:57,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1395652787, now seen corresponding path program 1 times [2021-01-06 18:45:57,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:45:57,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839256507] [2021-01-06 18:45:57,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:45:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:45:57,190 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-06 18:45:57,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839256507] [2021-01-06 18:45:57,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:45:57,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 18:45:57,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97857594] [2021-01-06 18:45:57,191 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 18:45:57,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:45:57,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 18:45:57,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-01-06 18:45:57,192 INFO L87 Difference]: Start difference. First operand 21962 states and 38827 transitions. Second operand 10 states. [2021-01-06 18:45:59,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:45:59,183 INFO L93 Difference]: Finished difference Result 24577 states and 42748 transitions. [2021-01-06 18:45:59,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-06 18:45:59,183 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2021-01-06 18:45:59,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:45:59,211 INFO L225 Difference]: With dead ends: 24577 [2021-01-06 18:45:59,211 INFO L226 Difference]: Without dead ends: 24043 [2021-01-06 18:45:59,217 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=368, Unknown=0, NotChecked=0, Total=552 [2021-01-06 18:45:59,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24043 states. [2021-01-06 18:46:00,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24043 to 22067. [2021-01-06 18:46:00,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22067 states. [2021-01-06 18:46:00,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22067 states to 22067 states and 38967 transitions. [2021-01-06 18:46:00,322 INFO L78 Accepts]: Start accepts. Automaton has 22067 states and 38967 transitions. Word has length 96 [2021-01-06 18:46:00,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:46:00,323 INFO L481 AbstractCegarLoop]: Abstraction has 22067 states and 38967 transitions. [2021-01-06 18:46:00,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 18:46:00,323 INFO L276 IsEmpty]: Start isEmpty. Operand 22067 states and 38967 transitions. [2021-01-06 18:46:00,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 18:46:00,339 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:46:00,339 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2021-01-06 18:46:00,339 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 18:46:00,340 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:46:00,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:46:00,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1195144083, now seen corresponding path program 1 times [2021-01-06 18:46:00,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:46:00,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436920668] [2021-01-06 18:46:00,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:46:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:46:00,428 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-06 18:46:00,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436920668] [2021-01-06 18:46:00,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:46:00,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 18:46:00,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949839155] [2021-01-06 18:46:00,432 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 18:46:00,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:46:00,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 18:46:00,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 18:46:00,433 INFO L87 Difference]: Start difference. First operand 22067 states and 38967 transitions. Second operand 7 states. [2021-01-06 18:46:01,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:46:01,744 INFO L93 Difference]: Finished difference Result 25637 states and 44298 transitions. [2021-01-06 18:46:01,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 18:46:01,745 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2021-01-06 18:46:01,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:46:01,773 INFO L225 Difference]: With dead ends: 25637 [2021-01-06 18:46:01,773 INFO L226 Difference]: Without dead ends: 22948 [2021-01-06 18:46:01,783 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-01-06 18:46:01,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22948 states. [2021-01-06 18:46:03,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22948 to 22049. [2021-01-06 18:46:03,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22049 states. [2021-01-06 18:46:03,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22049 states to 22049 states and 38905 transitions. [2021-01-06 18:46:03,057 INFO L78 Accepts]: Start accepts. Automaton has 22049 states and 38905 transitions. Word has length 96 [2021-01-06 18:46:03,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:46:03,057 INFO L481 AbstractCegarLoop]: Abstraction has 22049 states and 38905 transitions. [2021-01-06 18:46:03,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 18:46:03,057 INFO L276 IsEmpty]: Start isEmpty. Operand 22049 states and 38905 transitions. [2021-01-06 18:46:03,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 18:46:03,073 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:46:03,073 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2021-01-06 18:46:03,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 18:46:03,073 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:46:03,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:46:03,074 INFO L82 PathProgramCache]: Analyzing trace with hash 928693752, now seen corresponding path program 1 times [2021-01-06 18:46:03,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:46:03,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876049222] [2021-01-06 18:46:03,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:46:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:46:03,160 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-06 18:46:03,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876049222] [2021-01-06 18:46:03,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:46:03,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 18:46:03,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927759133] [2021-01-06 18:46:03,161 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 18:46:03,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:46:03,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 18:46:03,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:46:03,162 INFO L87 Difference]: Start difference. First operand 22049 states and 38905 transitions. Second operand 6 states. [2021-01-06 18:46:04,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:46:04,402 INFO L93 Difference]: Finished difference Result 24437 states and 42498 transitions. [2021-01-06 18:46:04,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 18:46:04,403 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2021-01-06 18:46:04,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:46:04,431 INFO L225 Difference]: With dead ends: 24437 [2021-01-06 18:46:04,431 INFO L226 Difference]: Without dead ends: 22460 [2021-01-06 18:46:04,442 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-01-06 18:46:04,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22460 states. [2021-01-06 18:46:05,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22460 to 21513. [2021-01-06 18:46:05,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21513 states. [2021-01-06 18:46:05,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21513 states to 21513 states and 38109 transitions. [2021-01-06 18:46:05,648 INFO L78 Accepts]: Start accepts. Automaton has 21513 states and 38109 transitions. Word has length 96 [2021-01-06 18:46:05,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:46:05,648 INFO L481 AbstractCegarLoop]: Abstraction has 21513 states and 38109 transitions. [2021-01-06 18:46:05,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 18:46:05,648 INFO L276 IsEmpty]: Start isEmpty. Operand 21513 states and 38109 transitions. [2021-01-06 18:46:05,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 18:46:05,663 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:46:05,664 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2021-01-06 18:46:05,664 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 18:46:05,664 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:46:05,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:46:05,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1597918002, now seen corresponding path program 1 times [2021-01-06 18:46:05,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:46:05,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228762533] [2021-01-06 18:46:05,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:46:05,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:46:05,746 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-06 18:46:05,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228762533] [2021-01-06 18:46:05,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:46:05,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:46:05,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849320603] [2021-01-06 18:46:05,747 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:46:05,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:46:05,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:46:05,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:46:05,748 INFO L87 Difference]: Start difference. First operand 21513 states and 38109 transitions. Second operand 4 states. [2021-01-06 18:46:06,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:46:06,700 INFO L93 Difference]: Finished difference Result 22111 states and 39038 transitions. [2021-01-06 18:46:06,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 18:46:06,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2021-01-06 18:46:06,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:46:06,732 INFO L225 Difference]: With dead ends: 22111 [2021-01-06 18:46:06,732 INFO L226 Difference]: Without dead ends: 20861 [2021-01-06 18:46:06,741 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 18:46:06,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20861 states. [2021-01-06 18:46:07,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20861 to 20861. [2021-01-06 18:46:07,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20861 states. [2021-01-06 18:46:07,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20861 states to 20861 states and 37147 transitions. [2021-01-06 18:46:07,860 INFO L78 Accepts]: Start accepts. Automaton has 20861 states and 37147 transitions. Word has length 96 [2021-01-06 18:46:07,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:46:07,860 INFO L481 AbstractCegarLoop]: Abstraction has 20861 states and 37147 transitions. [2021-01-06 18:46:07,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:46:07,860 INFO L276 IsEmpty]: Start isEmpty. Operand 20861 states and 37147 transitions. [2021-01-06 18:46:07,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-01-06 18:46:07,878 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:46:07,878 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2021-01-06 18:46:07,878 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 18:46:07,878 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:46:07,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:46:07,879 INFO L82 PathProgramCache]: Analyzing trace with hash -680057775, now seen corresponding path program 1 times [2021-01-06 18:46:07,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:46:07,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559901664] [2021-01-06 18:46:07,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:46:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:46:08,042 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-06 18:46:08,042 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559901664] [2021-01-06 18:46:08,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:46:08,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 18:46:08,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921716038] [2021-01-06 18:46:08,043 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 18:46:08,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:46:08,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 18:46:08,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-01-06 18:46:08,044 INFO L87 Difference]: Start difference. First operand 20861 states and 37147 transitions. Second operand 12 states. [2021-01-06 18:46:13,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:46:13,382 INFO L93 Difference]: Finished difference Result 59073 states and 103097 transitions. [2021-01-06 18:46:13,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-01-06 18:46:13,383 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 97 [2021-01-06 18:46:13,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:46:13,472 INFO L225 Difference]: With dead ends: 59073 [2021-01-06 18:46:13,472 INFO L226 Difference]: Without dead ends: 57932 [2021-01-06 18:46:13,488 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=305, Invalid=625, Unknown=0, NotChecked=0, Total=930 [2021-01-06 18:46:13,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57932 states. [2021-01-06 18:46:16,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57932 to 41490. [2021-01-06 18:46:16,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41490 states. [2021-01-06 18:46:16,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41490 states to 41490 states and 73867 transitions. [2021-01-06 18:46:16,398 INFO L78 Accepts]: Start accepts. Automaton has 41490 states and 73867 transitions. Word has length 97 [2021-01-06 18:46:16,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:46:16,398 INFO L481 AbstractCegarLoop]: Abstraction has 41490 states and 73867 transitions. [2021-01-06 18:46:16,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 18:46:16,398 INFO L276 IsEmpty]: Start isEmpty. Operand 41490 states and 73867 transitions. [2021-01-06 18:46:16,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-01-06 18:46:16,431 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:46:16,431 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2021-01-06 18:46:16,431 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 18:46:16,432 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:46:16,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:46:16,432 INFO L82 PathProgramCache]: Analyzing trace with hash -679998193, now seen corresponding path program 1 times [2021-01-06 18:46:16,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:46:16,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181693684] [2021-01-06 18:46:16,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:46:16,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:46:16,532 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:46:16,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181693684] [2021-01-06 18:46:16,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664480386] [2021-01-06 18:46:16,533 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 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 18:46:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:46:16,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-06 18:46:16,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 18:46:16,979 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:46:16,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 18:46:16,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-01-06 18:46:16,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422890601] [2021-01-06 18:46:16,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 18:46:16,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:46:16,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 18:46:16,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:46:16,982 INFO L87 Difference]: Start difference. First operand 41490 states and 73867 transitions. Second operand 6 states. [2021-01-06 18:46:20,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:46:20,573 INFO L93 Difference]: Finished difference Result 53894 states and 93589 transitions. [2021-01-06 18:46:20,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:46:20,574 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2021-01-06 18:46:20,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:46:20,643 INFO L225 Difference]: With dead ends: 53894 [2021-01-06 18:46:20,643 INFO L226 Difference]: Without dead ends: 50826 [2021-01-06 18:46:20,657 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:46:20,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50826 states. [2021-01-06 18:46:23,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50826 to 46172. [2021-01-06 18:46:23,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46172 states. [2021-01-06 18:46:23,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46172 states to 46172 states and 82201 transitions. [2021-01-06 18:46:23,403 INFO L78 Accepts]: Start accepts. Automaton has 46172 states and 82201 transitions. Word has length 97 [2021-01-06 18:46:23,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:46:23,403 INFO L481 AbstractCegarLoop]: Abstraction has 46172 states and 82201 transitions. [2021-01-06 18:46:23,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 18:46:23,403 INFO L276 IsEmpty]: Start isEmpty. Operand 46172 states and 82201 transitions. [2021-01-06 18:46:23,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-01-06 18:46:23,437 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:46:23,437 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:46:23,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-01-06 18:46:23,641 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:46:23,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:46:23,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1523800031, now seen corresponding path program 1 times [2021-01-06 18:46:23,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:46:23,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902162093] [2021-01-06 18:46:23,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:46:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:46:23,700 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 18:46:23,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902162093] [2021-01-06 18:46:23,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:46:23,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:46:23,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923527388] [2021-01-06 18:46:23,701 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:46:23,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:46:23,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:46:23,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:46:23,702 INFO L87 Difference]: Start difference. First operand 46172 states and 82201 transitions. Second operand 3 states. [2021-01-06 18:46:28,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:46:28,651 INFO L93 Difference]: Finished difference Result 129654 states and 231201 transitions. [2021-01-06 18:46:28,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 18:46:28,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2021-01-06 18:46:28,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:46:28,820 INFO L225 Difference]: With dead ends: 129654 [2021-01-06 18:46:28,821 INFO L226 Difference]: Without dead ends: 86322 [2021-01-06 18:46:28,867 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 18:46:29,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86322 states. [2021-01-06 18:46:33,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86322 to 83254. [2021-01-06 18:46:33,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83254 states. [2021-01-06 18:46:33,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83254 states to 83254 states and 149151 transitions. [2021-01-06 18:46:33,904 INFO L78 Accepts]: Start accepts. Automaton has 83254 states and 149151 transitions. Word has length 97 [2021-01-06 18:46:33,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:46:33,904 INFO L481 AbstractCegarLoop]: Abstraction has 83254 states and 149151 transitions. [2021-01-06 18:46:33,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 18:46:33,904 INFO L276 IsEmpty]: Start isEmpty. Operand 83254 states and 149151 transitions. [2021-01-06 18:46:34,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 18:46:34,196 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:46:34,199 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:46:34,199 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 18:46:34,199 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:46:34,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:46:34,200 INFO L82 PathProgramCache]: Analyzing trace with hash 351246213, now seen corresponding path program 1 times [2021-01-06 18:46:34,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:46:34,202 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377476832] [2021-01-06 18:46:34,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:46:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:46:34,266 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 18:46:34,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377476832] [2021-01-06 18:46:34,267 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:46:34,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:46:34,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46151818] [2021-01-06 18:46:34,268 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:46:34,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:46:34,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:46:34,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:46:34,272 INFO L87 Difference]: Start difference. First operand 83254 states and 149151 transitions. Second operand 3 states. [2021-01-06 18:46:43,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:46:43,008 INFO L93 Difference]: Finished difference Result 240628 states and 431291 transitions. [2021-01-06 18:46:43,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 18:46:43,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2021-01-06 18:46:43,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:46:43,353 INFO L225 Difference]: With dead ends: 240628 [2021-01-06 18:46:43,354 INFO L226 Difference]: Without dead ends: 160664 [2021-01-06 18:46:43,431 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 18:46:43,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160664 states. [2021-01-06 18:46:52,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160664 to 157596. [2021-01-06 18:46:52,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157596 states. [2021-01-06 18:46:52,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157596 states to 157596 states and 282801 transitions. [2021-01-06 18:46:52,614 INFO L78 Accepts]: Start accepts. Automaton has 157596 states and 282801 transitions. Word has length 98 [2021-01-06 18:46:52,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:46:52,614 INFO L481 AbstractCegarLoop]: Abstraction has 157596 states and 282801 transitions. [2021-01-06 18:46:52,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 18:46:52,615 INFO L276 IsEmpty]: Start isEmpty. Operand 157596 states and 282801 transitions. [2021-01-06 18:46:52,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-01-06 18:46:52,700 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:46:52,700 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:46:52,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-06 18:46:52,701 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:46:52,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:46:52,701 INFO L82 PathProgramCache]: Analyzing trace with hash -604161903, now seen corresponding path program 1 times [2021-01-06 18:46:52,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:46:52,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902561075] [2021-01-06 18:46:52,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:46:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:46:52,774 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 18:46:52,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902561075] [2021-01-06 18:46:52,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:46:52,775 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:46:52,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714183296] [2021-01-06 18:46:52,776 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:46:52,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:46:52,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:46:52,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:46:52,777 INFO L87 Difference]: Start difference. First operand 157596 states and 282801 transitions. Second operand 3 states. [2021-01-06 18:47:07,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:47:07,476 INFO L93 Difference]: Finished difference Result 430652 states and 771763 transitions. [2021-01-06 18:47:07,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 18:47:07,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2021-01-06 18:47:07,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:47:08,379 INFO L225 Difference]: With dead ends: 430652 [2021-01-06 18:47:08,380 INFO L226 Difference]: Without dead ends: 277668 [2021-01-06 18:47:08,549 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 18:47:08,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277668 states. [2021-01-06 18:47:23,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277668 to 274600. [2021-01-06 18:47:23,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274600 states. [2021-01-06 18:47:24,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274600 states to 274600 states and 491465 transitions. [2021-01-06 18:47:24,753 INFO L78 Accepts]: Start accepts. Automaton has 274600 states and 491465 transitions. Word has length 99 [2021-01-06 18:47:24,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:47:24,754 INFO L481 AbstractCegarLoop]: Abstraction has 274600 states and 491465 transitions. [2021-01-06 18:47:24,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 18:47:24,754 INFO L276 IsEmpty]: Start isEmpty. Operand 274600 states and 491465 transitions. [2021-01-06 18:47:24,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 18:47:24,867 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:47:24,867 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:47:24,867 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-01-06 18:47:24,867 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:47:24,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:47:24,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1635104871, now seen corresponding path program 1 times [2021-01-06 18:47:24,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:47:24,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782848708] [2021-01-06 18:47:24,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:47:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:47:25,492 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 18:47:25,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782848708] [2021-01-06 18:47:25,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:47:25,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:47:25,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564164344] [2021-01-06 18:47:25,495 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:47:25,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:47:25,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:47:25,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:47:25,496 INFO L87 Difference]: Start difference. First operand 274600 states and 491465 transitions. Second operand 3 states.